✦ LIBER ✦

The ratio of the irredundance and domination number of a graph

✍ Scribed by Lutz Volkmann

Book ID: 108316224
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 359 KB
Volume: 178
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)81829-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Domination and irredundance in the queen

Domination and irredundance in the queens' graph

✍ A.P Burger; E.J Cockayne; C.M Mynhardt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

The vertices of the queem;' graph {~, are the squares of an n × n chessboard and two squares are adjacent ifa queen placed on one covers the other. It is shown that the domination num;~'r of Q. is at most 31n/54 + O(1), that Q. possesses minimal dominating sets of cardina~tty 5n/2 -O(l) and that the

Distance irredundance and connected domi

Distance irredundance and connected domination numbers of a graph

✍ Jun-Ming Xu; Fang Tian; Jia Huang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 258 KB

The irredundance number and maximum degr

The irredundance number and maximum degree of a graph

✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

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

On the ratio of the domination number an

On the ratio of the domination number and the independent domination number in graphs

✍ Furuya, Michitaka; Ozeki, Kenta; Sasaki, Akinari 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 306 KB