𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Wayne Goddard; Michael A. Henning

Book ID
106047820
Publisher
Springer Japan
Year
2009
Tongue
English
Weight
568 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β€’ V-V' there exists some uβ€’ V' for which {v,u} β€’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu