Domination, independent domination and \(k\)-independence in trees

DOI10.11650/tjm/211005zbMath1485.05142OpenAlexW4221098366MaRDI QIDQ2119697

Gang Zhang, Baoyindureng Wu

Publication date: 30 March 2022

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm/211005

zbMATH Keywords

treesdomination\(k\)-independenceindependent domination

Mathematics Subject Classification ID

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

Related Items

Closed formulas for the independent (Roman) domination number of rooted product graphs

Cites Work

• \(k\)-domination and \(k\)-independence in graphs: A survey
• Ratios of some domination parameters in trees
• On graphs having domination number half their order
• A characterization of \(i\)-excellent trees
• On \(k\)-dependent domination
• A note on connected bipartite graphs having independent domination number half their order.
• Independent domination in graphs: A survey and recent results
• Domination number, independent domination number and 2-independence number in trees
• On \(k\)-domination and \(j\)-independence in graphs
• On \(k\)-independence in graphs with emphasis on trees
• Maximal k-independent sets in graphs
• Lower bound on the domination number of a tree