Bounds on the connected k-domination number in graphs

DOI10.1016/J.DAM.2010.05.021zbMATH Open1215.05124OpenAlexW2050150370MaRDI QIDQ608255FDOQ608255

Authors: Adriana Hansberg 

Publication date: 25 November 2010

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

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

Recommendations

• On connected \(k\)-domination numbers of graphs.
• On distance connected domination numbers of graphs.
• On connected \(k\)-domination in graphs
• \(k\)-domination and connected \(k\)-domination in graphs
• A bound on the \(k\)-domination number of a graph.

zbMATH Keywords

\(k\)-dominationconnected \(k\)-dominationconnected total \(k\)-dominationtotal \(k\)-domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Hadwiger's Number and the Stability Number
• Dominating a family of graphs with small connected subgraphs
• A general method in the theory of domination in graphs
• Connected \(p\)-domination in graphs

Cited In (33)

• Bounds relating generalized domination parameters
• Some necessary conditions for graphs with extremal connected 2-domination number
• A bound on the \(k\)-domination number of a graph.
• Title not available (Why is that?)
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• On connected \(k\)-domination in graphs
• \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
• Connected \(k\)-dominating graphs
• Dominating a family of graphs with small connected subgraphs
• On connected \(k\)-domination numbers of graphs.
• Title not available (Why is that?)
• Distance irredundance and connected domination numbers of a graph
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• On distance connected domination numbers of graphs.
• A note on the saturation number of the family of \(k\)-connected graphs
• BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
• Bounds on the \(k\)-domination number of a graph
• Another look at \(k\)-domination in graphs
• On the Number of Connected Sets in Bounded Degree Graphs
• Intersections of largest bonds in \(k\)-connected graphs
• Generalized connected domination in graphs
• Title not available (Why is that?)
• Exponential domination in subcubic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on the exponential domination number
• Relating the size of a connected graph to its total and restricted domination numbers
• A note on graphs with largest total \(k\)-domination number.
• Connected domination
• Multiple domination
• \(k\)-domination and connected \(k\)-domination 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)