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

DOI10.1016/j.dam.2020.03.019zbMath1443.05136OpenAlexW3013669031MaRDI QIDQ777366

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

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)

Related Items

Unnamed Item

Cites Work

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