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

DOI10.1016/J.DAM.2020.03.019zbMATH Open1443.05136OpenAlexW3013669031MaRDI QIDQ777366FDOQ777366

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On \(k\)-domination and \(j\)-independence in graphs
• Some bounds on the \(p\)-domination number in trees
• Title not available (Why is that?)
• Improved lower bounds on k‐independence
• Title not available (Why is that?)
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Independent domination in graphs: A survey and recent results
• Title not available (Why is that?)
• Connected domination game
• Title not available (Why is that?)
• Relating the annihilation number and the 2-domination number of a tree
• A note on the k-domination number of a graph
• \(H\)-forming sets in graphs
• Relating the annihilation number and the 2-domination number of block graphs
• Bounds on the 2-domination number
• A note on the annihilation number and 2-domination number of a tree
• On the Number ofk-Dominating Independent Sets

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction of Halin graph with perfect k-ary tree and its independent domination number
• An independent dominating set in the complement of a minimum dominating set of a tree

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)