Bounds on the connected k-domination number in graphs
From MaRDI portal
Publication:608255
Recommendations
Cites work
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (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?)
- A general method in the theory of domination in graphs
- Connected \(p\)-domination in graphs
- Dominating a family of graphs with small connected subgraphs
- On Hadwiger's Number and the Stability Number
Cited in
(33)- Another look at \(k\)-domination in graphs
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- On the Number of Connected Sets in Bounded Degree Graphs
- On connected \(k\)-domination in graphs
- scientific article; zbMATH DE number 7489191 (Why is no real title available?)
- A note on graphs with largest total \(k\)-domination number.
- \(k\)-domination and connected \(k\)-domination in graphs
- scientific article; zbMATH DE number 4075103 (Why is no real title available?)
- Intersections of largest bonds in \(k\)-connected graphs
- Bounds on the \(k\)-domination number of a graph
- Dominating a family of graphs with small connected subgraphs
- Multiple domination
- scientific article; zbMATH DE number 7034398 (Why is no real title available?)
- Bounds on the exponential domination number
- scientific article; zbMATH DE number 2186977 (Why is no real title available?)
- Connected \(k\)-dominating graphs
- Bounds relating generalized domination parameters
- Distance irredundance and connected domination numbers of a graph
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
- scientific article; zbMATH DE number 2145745 (Why is no real title available?)
- A note on the saturation number of the family of \(k\)-connected graphs
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- Relating the size of a connected graph to its total and restricted domination numbers
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Exponential domination in subcubic graphs
- Connected domination
- Generalized connected domination in graphs
- On distance connected domination numbers of graphs.
- On connected \(k\)-domination numbers of graphs.
- A bound on the \(k\)-domination number of a graph.
- Some necessary conditions for graphs with extremal connected 2-domination number
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
This page was built for publication: Bounds on the connected \(k\)-domination number in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608255)