A bound on the k-domination number of a graph

DOI10.1007/s10587-010-0019-1zbMath1224.05385OpenAlexW2047283999MaRDI QIDQ3073450

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)

Related Items (2)

\(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Multiple Domination

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• On graphs having domination number half their order
• Upper bounds for \(f\)-domination number of graphs
• Onk-domination and minimum degree in graphs
• An upper bound for thek-domination number of a graph
• Domination-balanced graphs
• A new domination conception
• On $f$-domination number of a graph
• Inequalities involving independence domination, f-domination, connected and total f-domination numbers

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