✦ LIBER ✦

Graphs having distance-n domination number half their order

✍ Scribed by Miranca Fischermann; and Lutz Volkmann

Book ID: 104444457
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 87 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80022-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs having domination number half

On graphs having domination number half their order

✍ J. F. Fink; M. S. Jacobson; L. F. Kinch; J. Roberts 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 434 KB

A Characterization of Cubic Graphs with

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 568 KB

Claw-free cubic graphs with clique-trans

Claw-free cubic graphs with clique-transversal number half of their order

✍ Erfang Shan; Haichao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted by τ C (G), is the minimum cardinality of a cliquetransversal set in G. In 2008, we showed that the clique-transversal number of every clawfree cubic graph is