✦ LIBER ✦

On graphs having domination number half their order

✍ Scribed by J. F. Fink; M. S. Jacobson; L. F. Kinch; J. Roberts

Book ID: 105327281
Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 434 KB
Volume: 16
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf01848079

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs having distance-n domination numb

Graphs having distance-n domination number half their order

✍ Miranca Fischermann; and Lutz Volkmann 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

On graphs whose domination numbers equal

On graphs whose domination numbers equal their independent domination numbers

✍ Belmannu Devadas Acharya; Purnima Gupta 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 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

On independent domination number of regu

On independent domination number of regular graphs

✍ Peter Che Bor Lam; Wai Chee Shiu; Liang Sun 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Bounds on the connected -domination numb

Bounds on the connected -domination number in graphs

✍ Adriana Hansberg 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 234 KB