Bounds on the connected domination number of a graph

DOI10.1016/j.dam.2013.06.023zbMath1287.05100OpenAlexW2073223421MaRDI QIDQ2446883

Michael A. Henning, Teresa W. Haynes, Wyatt J. Desormeaux

Publication date: 23 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.023

zbMATH Keywords

girthconnected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (15)

Computational approaches for zero forcing and related problems ⋮ Traceability of connected domination critical graphs ⋮ Disprove of a conjecture on the doubly connected domination subdivision number ⋮ On domination-type invariants of Fibonacci cubes and hypercubes ⋮ Domination parameters on Cayley digraphs of transformation semigroups with fixed sets ⋮ Connected domination in maximal outerplanar graphs ⋮ Connected power domination in graphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ Partial domination - the isolation number of a graph ⋮ Some comments on the Slater number ⋮ Complexity and computation of connected zero forcing ⋮ The hub number, girth and Mycielski graphs ⋮ Connected Domination ⋮ Total domination in digraphs ⋮ A note on connected domination number and leaf number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs for which the connected domination number is at most the total domination number
• A survey of selected recent results on total domination in graphs
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• Every planar map is four colorable
• Connected Domination and Spanning Trees with Many Leaves
• Domination in planar graphs with small diameter*
• Total Domination in Graphs

This page was built for publication: Bounds on the connected domination number of a graph