Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs

DOI10.1016/j.endm.2016.09.020zbMath1356.05100OpenAlexW2537802768MaRDI QIDQ510554

Gregorio Hernández, Mafalda Martins, Irene Castro, Santiago Canales

Publication date: 13 February 2017

Full work available at URL: http://oa.upm.es/48744/

zbMATH Keywords

connectivitydominationmaximal outerplanar graph

Mathematics Subject Classification ID

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) Connectivity (05C40)

Related Items (6)

Partial domination of maximal outerplanar graphs ⋮ Extensions of the Art Gallery Theorem ⋮ Total domination in plane triangulations ⋮ Combinatorial bounds on paired and multiple domination in triangulations ⋮ Isolation number of maximal outerplanar graphs ⋮ Semipaired domination in maximal outerplanar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance domination, guarding and covering of maximal outerplanar graphs
• Total domination in maximal outerplanar graphs. II.
• Dominating sets whose closed stars form spanning trees
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Dominating sets of maximal outerplanar graphs

This page was built for publication: Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs