An upper bound on the domination number of \(n\)-vertex connected cubic graphs

DOI10.1016/j.disc.2007.12.009zbMath1179.05083OpenAlexW2153219831MaRDI QIDQ1011787

B. Y. Stodolsky, Alexandr V. Kostochka

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.009

zbMATH Keywords

cubic graphsdominationconnected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Domination in Cubic Graphs of Large Girth ⋮ Decreasing the maximum degree of a graph ⋮ Domination number of graphs with minimum degree five ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ Partial domination in supercubic graphs ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs ⋮ Domination number of cubic graphs with large girth ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5

Cites Work

• On domination in 2-connected cubic graphs
• The domination number of cubic Hamiltonian graphs
• Domination in graphs of minimum degree at least two and large girth
• On domination in connected cubic graphs
• Paths, Stars and the Number Three
• Domination in a graph with a 2‐factor

This page was built for publication: An upper bound on the domination number of \(n\)-vertex connected cubic graphs