Independent (k + 1)-domination in k-trees

DOI10.1016/J.DAM.2020.03.019MaRDI QIDQ777366zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki, Anna Fiedorowicz, Elżbieta Sidorowicz, Zsolt Tuza

Publication date 7 July 2020

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

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

zbMATH Keywords

independent domination2-tree\(k\)-dominationindependent 3-domination

Mathematics Subject Classification ID

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

Recommendations

• Domination, independent domination and \(k\)-independence in trees
• On independent \([1, 2]\)-sets in trees
• Trees with extremal numbers of \(k\)-dominating sets
• On the number of \(k\)-dominating independent sets
• Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets

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?)
• scientific article; zbMATH DE number 2230941 (Why is no real title available?)
• A note on the annihilation number and 2-domination number of a tree
• A note on the k-domination number of a graph
• Bounds on the 2-domination number
• Connected domination game
• Improved lower bounds on k‐independence
• Independence and 2-domination in bipartite graphs
• Independent domination in graphs: A survey and recent results
• On \(k\)-domination and \(j\)-independence in graphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On the number of \(k\)-dominating independent sets
• Relating the annihilation number and the 2-domination number of a tree
• Relating the annihilation number and the 2-domination number of block graphs
• Some bounds on the \(p\)-domination number in trees
• \(H\)-forming sets in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(8)

• scientific article; zbMATH DE number 7355464 (Why is no real title available?)
• On independent \([1, 2]\)-sets in trees
• On the number of \(k\)-dominating independent sets
• An independent dominating set in the complement of a minimum dominating set of a tree
• scientific article; zbMATH DE number 6694457 (Why is no real title available?)
• Domination, independent domination and \(k\)-independence in trees
• Construction of Halin graph with perfect k-ary tree and its independent domination number
• Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets

This page was built for publication: Independent \((k + 1)\)-domination in \(k\)-trees

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