Disjunctive total domination in maximal outerplanar graphs

DOI10.1007/S00010-026-01301-WMaRDI QIDQ7261471zbMATH OpenFDO

Authors Michael A. Henning, Paras Vinubhai Maniya, D. Pradhan

Publication date 10 June 2026

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00010-026-01301-W

zbMATH Keywords

disjunctive total dominationdominationmaximal outerplanar graphstotal domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• Bounds on the disjunctive total domination number of a tree
• Disjunctive domination in maximal outerplanar graphs
• Disjunctive total domination in graphs
• Dominating sets in planar graphs
• Dominating sets inducing large components in maximal outerplanar graphs
• Domination in Graphs: Core Concepts
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• Graphs with large disjunctive total domination number
• On the secure domination numbers of maximal outerplanar graphs
• Secure total domination number in maximal outerplanar graphs
• Structures of domination in graphs
• Topics in Domination in Graphs
• Total domination in graphs
• Total domination in maximal outerplanar graphs. II.

This page was built for publication: Disjunctive total domination in maximal outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261471)