𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Domination Number of Cubic Graphs with Girth at least Five

✍ Scribed by David C. Fisher; Kathryn Fraughnaugh; Suzanne M. Seager

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
356 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Domination number of cubic graphs with l
Domination number of cubic graphs with large girth
✍ Daniel KrΓ‘l'; Petr Ε koda; Jan Volec πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Ε koda was a student of

Decomposing graphs with girth at least f
Decomposing graphs with girth at least five under degree constraints
✍ Diwan, Ajit A. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 2 views

We prove that the vertex set of a simple graph with minimum degree at least s + t -1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers β‰₯ 2.

Group chromatic number of planar graphs
Group chromatic number of planar graphs of girth at least 4
✍ Hong-Jian Lai; Xiangwen Li πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 212 KB πŸ‘ 1 views

## Abstract Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5‐edge connected graph is Z~3~‐connected. For planar graphs, this is equivalent to that every planar graph with girth at lea

The difference between the domination nu
The difference between the domination number and the minus domination number of a cubic graph
✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph