A new bound on the domination number of connected cubic graphs

MaRDI QIDQ2454559zbMATH OpenFDO

Authors Christopher J. Stocker, Alexandr Kostochka

Publication date 13 June 2014

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v6/p465-504.pdf

zbMATH Keywords

connected graphcubic graphdomination

Mathematics Subject Classification ID

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

Recommendations

• An upper bound on the domination number of \(n\)-vertex connected cubic graphs
• On domination in connected cubic graphs
• 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

Cited in

(24)

• On domination in 2-connected cubic graphs
• An upper bound on the domination number of \(n\)-vertex connected cubic graphs
• An improved upper bound on the total restrained domination number in cubic graphs
• On (1,2)-domination in cubic graphs
• Minimum maximal matchings in cubic graphs
• Bounds on domination parameters in graphs: a brief survey
• Decreasing the maximum degree of a graph
• Vertex-edge domination in cubic graphs
• Dominating vertex covers: the vertex-edge domination problem
• The domination number of cubic Hamiltonian graphs
• On \(k\)-domination and \(j\)-independence in graphs
• On domination in connected cubic graphs
• Domination number of cubic graphs with large girth
• Eternal and Secure Domination in Graphs
• Independent domination in cubic graphs
• Domination versus disjunctive domination in graphs
• My favorite domination conjectures in graph theory are bounded
• Partial domination in supercubic graphs
• Best possible upper bounds on the restrained domination number of cubic graphs
• Domination of triangulated discs and maximal outerplanar graphs
• On the domination number of graphs with minimum degree at least seven
• Domination and packing in graphs
• Domination in 4-regular graphs with no induced 4-cycles
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs

This page was built for publication: A new bound on the domination number of connected cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454559)