A characterization of trees with equal independent domination and secure domination numbers
From MaRDI portal
(Redirected from Publication:503603)
Recommendations
Cites work
- scientific article; zbMATH DE number 2094533 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- scientific article; zbMATH DE number 2188623 (Why is no real title available?)
- A linear algorithm for secure domination in trees
- Edge criticality in secure graph domination
- Independent and double domination in trees
- Irredundance, secure domination and maximum degree in trees
- On minimum secure dominating sets of graphs
- On secure domination in graphs
- Secure domination and secure total domination in graphs
- Secure domination critical graphs
- Two algorithms for secure graph domination
- Vertex Covers and Secure Domination in Graphs
Cited in
(10)- 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
- Secure domination parameters of Halin graph with perfect k-ary tree
- A note of independent number and domination number of \(Q_{n, k, m}\)-graph
- 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
- 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)
