A characterization of trees with equal independent domination and secure domination numbers
From MaRDI portal
Publication:503603
DOI10.1016/J.IPL.2016.11.004zbMATH Open1400.05176OpenAlexW2553116708MaRDI QIDQ503603FDOQ503603
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
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Vertex Covers and Secure Domination in Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irredundance, secure domination and maximum degree in trees
- Secure domination critical graphs
- On secure domination in graphs
- Secure domination and secure total domination in graphs
- On minimum secure dominating sets of graphs
- Edge criticality in secure graph domination
- A linear algorithm for secure domination in trees
- Independent and double domination in trees
- Title not available (Why is that?)
Cited In (10)
- A Note of Independent Number and Domination Number of Qn,k,m-Graph
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- Restrained domination in self-complementary graphs
- On construction for trees making the equality hold in Vizing's conjecture
- Eternal and Secure Domination in Graphs
- Secure domination in proper interval graphs
- Equalityof Secure Domination and Inverse Secure Domination Numbers
- Domination versus semipaired domination in trees
- Title not available (Why is that?)
- Independent transversal total domination versus total domination in trees
This page was built for publication: A characterization of trees with equal independent domination and secure domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503603)
