Secure domination subdivision number of a graph
From MaRDI portal
Recommendations
Cites work
- Domination alteration sets in graphs
- Domination and independence subdivision numbers of graphs
- Domination Subdivision Numbers
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1934399 (Why is no real title available?)
- scientific article; zbMATH DE number 1539534 (Why is no real title available?)
- scientific article; zbMATH DE number 2149834 (Why is no real title available?)
- scientific article; zbMATH DE number 975422 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- Roman domination subdivision number of a graph and its complement.
- Roman domination subdivision number of graphs
- Total domination subdivision numbers of graphs
- Total domination subdivision numbers of trees
- Upper bounds for the Roman domination subdivision number of a graph
Cited in
(14)- Secure domination critical graphs
- Global secure domination in graphs
- On the secure domination numbers of maximal outerplanar graphs
- Secure restrained domination in graphs
- Upper secure domination number of a graph
- scientific article; zbMATH DE number 5139466 (Why is no real title available?)
- Vertex Covers and Secure Domination in Graphs
- Secure domination in middle graphs
- Equalityof Secure Domination and Inverse Secure Domination Numbers
- Open packing subdivision number of graphs
- Secure domination of some graph operators
- Secure domination parameters of Halin graph with perfect k-ary tree
- Secure equitable subdivision number of graphs
- NP-completeness and bounds for disjunctive total domination subdivision
This page was built for publication: Secure domination subdivision number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968284)
