✦ LIBER ✦

Independent dominating sets in regular graphs

✍ Scribed by Julie Haviland

Book ID: 120694111
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 293 KB
Volume: 26
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-011-9439-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent Dominating Sets and a Second

Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs

✍ Carsten Thomassen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 241 KB

In 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamiltonian cycle. Combined with earlier results this would imply that every Hamiltonian r-regular graph (r 3) has a second Hamiltonian cycle. We shall verify this for r 300.

Independent sets in regular graphs

✍ M. Rosenfeld 📂 Article 📅 1964 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 449 KB

Independent dominating sets in triangle-

Independent dominating sets in triangle-free graphs

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 439 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

Large 2-Independent Sets of Regular Grap

Large 2-Independent Sets of Regular Graphs

✍ W. Duckworth; M. Zito 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Dominating Sets in Planar Graphs

✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB