✦ LIBER ✦

Total restrained domination in claw-free graphs with minimum degree at least two

✍ Scribed by Ernst J. Joubert

Book ID: 113564627
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 392 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restrained Domination in Claw-Free Graph

Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two

✍ Johannes H. Hattingh; Ernst J. Joubert 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 233 KB

Total restrained domination in graphs wi

Total restrained domination in graphs with minimum degree two

✍ M.A. Henning; J.E. Maritz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Total restrained domination in claw-free

Total restrained domination in claw-free graphs

✍ Hongxing Jiang; Liying Kang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 307 KB

Vertex-Disjoint Triangles in Claw-Free G

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three

✍ Hong Wang 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 160 KB

Domination in Graphs of Minimum Degree a

Domination in Graphs of Minimum Degree at least Two and Large Girth

✍ Christian Löwenstein; Dieter Rautenbach 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 116 KB

Domination in graphs with minimum degree

Domination in graphs with minimum degree two

✍ William McCuaig; Bruce Shepherd 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

The domination number y ( G ) of a graph G = (V E ) is the minimum cardinality of a subset of Vsuch that every vertex is either in the set or is adjacent to some vertex in the set. We show that if a connected graph G has minimum2degree two and is not one of seven exceptional graphs, then y ( g ) I ~