Independence and k-domination in graphs

DOI10.1080/00207160.2010.482664MaRDI QIDQ2995488zbMATH OpenOpenAlexFDO

Authors Adriana Hansberg, Dirk Meierling, Lutz Volkmann

Publication date 21 April 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2010.482664

zbMATH Keywords

maximum independent setk-domination

Mathematics Subject Classification ID

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

Recommendations

• A bound on the k-domination number of a graph.
• scientific article; zbMATH DE number 2544
• Onk-domination and minimum degree in graphs
• On the k-independence number in graphs
• Domination, independent domination and \(k\)-independence in trees

Cites work

• 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 note on the k-domination number of a graph
• An upper bound for thek-domination number of a graph
• Onk-domination and minimum degree in graphs
• Some bounds on the p-domination number in trees

Cited in

(24)

• Relating the annihilation number and the 2-domination number of a tree
• Trees with 2-reinforcement number three
• A note on the annihilation number and 2-domination number of a tree
• Trees with maximum \(p\)-reinforcement number
• \(k\)-domination and \(k\)-independence in graphs: A survey
• scientific article; zbMATH DE number 1420902 (Why is no real title available?)
• Domination number, independent domination number and 2-independence number in trees
• Independence and graph homomorphisms graph homomorphisms
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• scientific article; zbMATH DE number 6694457 (Why is no real title available?)
• scientific article; zbMATH DE number 1389216 (Why is no real title available?)
• The annihilation number does not bound the 2-domination number from the above
• An improvement on the maximum number of k-dominating independent sets
• k-Independence and thek-residue of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\)
• On the k-domination number, the domination number and the cycle of length four
• Isolation of \(k\)-cliques. II
• Cycle domination, independence, and irredundance in graphs
• Relating the annihilation number and the 2-domination number of block graphs
• Domination, independent domination and \(k\)-independence in trees
• Multiple domination
• New results on \(k\)-independence of graphs

This page was built for publication: Independence and \(k\)-domination in graphs

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