✦ LIBER ✦

Distance irredundance and connected domination numbers of a graph

✍ Scribed by Jun-Ming Xu; Fang Tian; Jia Huang

Book ID: 108113667
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 258 KB
Volume: 306
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.075

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stability, domination and irredundance i

Stability, domination and irredundance in a graph

✍ Odile Favaron 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 441 KB

In a graph G, a set X is called a stable set if any two vertices of X are nonadjacent. A set X is called a dominating set if every vertex of V-X is joined to at least one vertex of X. A set Xis called an irredundant set if every vertex of X, not isolated in X, has at least one proper neighbor, that

The sequence of upper and lower dominati

The sequence of upper and lower domination, independence and irredundance numbers of a graph

✍ E.J. Cockayne; C.M. Mynhardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 803 KB

Necessary and sufficient conditions are established for the existence of a graph whose upper and lower domination, independence and irredundance numbers are six given positive integers. This result shows that the only relationships between these six parameters which hold for all graphs and which do

The ratio of the irredundance and domina

The ratio of the irredundance and domination number of a graph

✍ Lutz Volkmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 359 KB

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Distance paired domination numbers of gr

Distance paired domination numbers of graphs

✍ Joanna Raczek 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 197 KB

The ratio of the irredundance number and

The ratio of the irredundance number and the domination number for block-cactus graphs

✍ Zverovich, V. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 2 views

Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and Bollobás and Cock- ayne [J. Graph Theory (1979) 241-249] proved independently that γ(G) < 2ir(G) for