Bounds on the connected domination number of a graph
From MaRDI portal
Publication:2446883
Recommendations
Cites work
- A survey of selected recent results on total domination in graphs
- Connected Domination and Spanning Trees with Many Leaves
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Domination in planar graphs with small diameter*
- Every planar map is four colorable
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On graphs for which the connected domination number is at most the total domination number
- Total domination in graphs
Cited in
(35)- On connected cutfree domination in graphs
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Computational approaches for zero forcing and related problems
- Bounds on the domination number of a digraph
- Connected domsaturation number of a graph
- Relating the size of a connected graph to its total and restricted domination numbers
- Complexity and computation of connected zero forcing
- The hub number, girth and Mycielski graphs
- A note on connected domination number and leaf number
- Disprove of a conjecture on the doubly connected domination subdivision number
- Connected domination in maximal outerplanar graphs
- Connected power domination in graphs
- Bounds on the k-domination number of a graph
- Traceability of connected domination critical graphs
- An inequality on connected domination parameters
- On the Number of Connected Sets in Bounded Degree Graphs
- scientific article; zbMATH DE number 7034398 (Why is no real title available?)
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Connected domination
- scientific article; zbMATH DE number 5717193 (Why is no real title available?)
- scientific article; zbMATH DE number 637618 (Why is no real title available?)
- On domination-type invariants of Fibonacci cubes and hypercubes
- On the sum of the total domination numbers of a digraph and its converse
- scientific article; zbMATH DE number 6120615 (Why is no real title available?)
- scientific article; zbMATH DE number 7489191 (Why is no real title available?)
- Domination parameters on Cayley digraphs of transformation semigroups with fixed sets
- Partial domination -- the isolation number of a graph
- Total domination in digraphs
- Some comments on the Slater number
- Size, Order, and Connected Domination
- Nordhaus-Gaddum type results for connected domination number of graphs
- Connected domination in graphs and v-numbers of binomial edge ideals
- Connected domination versus dominating sets inducing large components
- Domination parameters on Cayley digraphs of full transformation semigroups relative to Green's equivalence \(\mathcal{L}\)-classes and their complements
- Trees with the connected domination number
This page was built for publication: Bounds on the connected domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446883)
