Isolation number of maximal outerplanar graphs
From MaRDI portal
Publication:2322891
DOI10.1016/j.dam.2019.06.011zbMath1420.05137OpenAlexW2964326254WikidataQ127498550 ScholiaQ127498550MaRDI QIDQ2322891
Thiradet Jiarasuksakun, Pawaton Kaemawichanurat, Shin-ichi Tokunaga
Publication date: 5 September 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.011
Related Items (16)
Isolation of the diamond graph ⋮ Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ \( P_5\)-isolation in graphs ⋮ Isolation of connected graphs ⋮ A sharp upper bound on the cycle isolation number of graphs ⋮ On the general position numbers of maximal outerplane graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ \(K_{1, 2}\)-isolation number of claw-free cubic graphs ⋮ Cycle isolation of graphs with small girth ⋮ A note on the cycle isolation number of graphs ⋮ Extensions of the Art Gallery Theorem ⋮ \( K_{1 , 2}\)-isolation in graphs ⋮ Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)] ⋮ Domination and outer connected domination in maximal outerplanar graphs ⋮ Admissible property of graphs in terms of radius ⋮ Double domination in maximal outerplanar graphs
Cites Work
- Unnamed Item
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
- A short proof of Chvatal's Watchman Theorem
- A combinatorial theorem in plane geometry
- Dominating sets in planar graphs
- Total dominating sets in maximal outerplanar graphs
- Semipaired domination in claw-free cubic graphs
- Dominating sets of maximal outerplanar graphs
- Partial domination - the isolation number of a graph
This page was built for publication: Isolation number of maximal outerplanar graphs
