✦ LIBER ✦

On graphs with equal domination and independent domination numbers

✍ Scribed by Jerzy Topp; Lutz Volkmann

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 284 KB
Volume: 96
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90473-f

No coin nor oath required. For personal study only.

✦ Synopsis

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80.

Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal domination and independent domination numbers are presented. In particular, the result of Allan and Laskar is generalized.

📜 SIMILAR VOLUMES

Domination critical graphs with higher i

Domination critical graphs with higher independent domination numbers

✍ Ao, S.; Cockayne, E.J.; MacGillivray, G.; Mynhardt, C.M. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB 👁 2 views

We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch ( J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3.

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

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that

Independent perfect domination sets in C

Independent perfect domination sets in Cayley graphs

✍ Jaeun Lee 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

Graphs with large total domination numbe

Graphs with large total domination number

✍ Michael A. Henning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

Characterizations of trees with equal do

Characterizations of trees with equal domination parameters

✍ Johannes H. Hattingh; Michael A. Henning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB