✦ LIBER ✦

Domination, independent domination, and duality in strongly chordal graphs

✍ Scribed by Martin Farber

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 1006 KB
Volume: 7
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90061-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent domination in chordal graphs

✍ Martin Farber 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Steiner trees, connected domination and

Steiner trees, connected domination and strongly chordal graphs

✍ Kevin White; Martin Farber; William Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

The parallel solution of domination prob

The parallel solution of domination problems on chordal and strongly chordal graphs

✍ Elias Dahlhaus; Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 975 KB

Independent domination in regular graphs

✍ Julie Haviland 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th

Chordal graphs and upper irredundance, u

Chordal graphs and upper irredundance, upper domination and independence

✍ Michael S. Jacobson; Ken Peters 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of

On graphs with equal domination and inde

On graphs with equal domination and independent domination numbers

✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

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 d