A characterization of trees with equal independent domination and secure domination numbers

DOI10.1016/j.ipl.2016.11.004zbMath1400.05176OpenAlexW2553116708MaRDI QIDQ503603

Zepeng Li, Jin Xu

Publication date: 13 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.11.004

zbMATH Keywords

treecombinatorial problemsindependent domination numbersecure domination number

Mathematics Subject Classification ID

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

Related Items (9)

Secure domination in proper interval graphs ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Independent transversal total domination versus total domination in trees ⋮ Unnamed Item ⋮ Restrained domination in self-complementary graphs ⋮ Domination versus semipaired domination in trees ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Eternal and Secure Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irredundance, secure domination and maximum degree in trees
• Secure domination critical graphs
• Edge criticality in secure graph domination
• On secure domination in graphs
• A linear algorithm for secure domination in trees
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• On minimum secure dominating sets of graphs

This page was built for publication: A characterization of trees with equal independent domination and secure domination numbers