Secure total domination number in maximal outerplanar graphs
From MaRDI portal
Publication:6546418
DOI10.1016/j.dam.2024.04.007zbMATH Open1545.05161MaRDI QIDQ6546418
Publication date: 29 May 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
- Secure domination in proper interval graphs
- On the secure domination numbers of maximal outerplanar graphs
- On computing a minimum secure dominating set in block graphs
- The secure domination problem in cographs
- A simple algorithm for secure domination in proper interval graphs
- Secure total domination in graphs: bounds and complexity
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- On secure domination in graphs
- Total dominating sets in maximal outerplanar graphs
- Secure domination in cographs
- Dominating sets of maximal outerplanar 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
- On secure domination in trees
Related Items (2)
An algorithm for the secure total domination problem in proper interval graphs ⋮ A lower bound for secure domination number of an outerplanar graph
This page was built for publication: Secure total domination number in maximal outerplanar graphs
