A bound on the k-domination number of a graph.

DOI10.1007/S10587-010-0019-1MaRDI QIDQ3073450zbMATH OpenOpenAlexFDO

Authors Lutz Volkmann

Publication date 11 February 2011

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/37989

zbMATH Keywords

domination\(P_4\)-free graph\(k\)-domination number

Mathematics Subject Classification ID

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

Recommendations

• Onk-domination and minimum degree in graphs
• An upper bound for thek-domination number of a graph
• A note on the k-domination number of a graph
• Bounds on the connected \(k\)-domination number in graphs
• Bounds on the \(k\)-domination number of a graph

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• A new domination conception
• A note on the k-domination number of a graph
• An upper bound for thek-domination number of a graph
• Bounds of the 2-domination number of graphs
• Domination-balanced graphs
• Inequalities involving independence domination, f-domination, connected and total f-domination numbers
• On $f$-domination number of a graph
• On graphs having domination number half their order
• Onk-domination and minimum degree in graphs
• Upper bounds for \(f\)-domination number of graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number

Cited in

(19)

• scientific article; zbMATH DE number 1406878 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• An upper bound for thek-domination number of a graph
• \(k\)-domination and \(k\)-independence in graphs: A survey
• scientific article; zbMATH DE number 2192183 (Why is no real title available?)
• Dominating sets inducing large components
• Implications of some observations about the \(k\)-domination number
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• Independence and \(k\)-domination in graphs
• Bounds on the \(k\)-domination number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• Bipartite graphs with close domination and \(k\)-domination numbers
• scientific article; zbMATH DE number 4075103 (Why is no real title available?)
• scientific article; zbMATH DE number 2188621 (Why is no real title available?)
• Onk-domination and minimum degree in graphs
• Bounds on the connected \(k\)-domination number in graphs
• On the \(k\)-domination number, the domination number and the cycle of length four
• Bounds on the upper \(k\)-domination number and the upper \(k\)-star-forming number of a graph
• Multiple domination

This page was built for publication: A bound on the \(k\)-domination number of a graph.

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