Distance domination, guarding and vertex cover for maximal outerplanar graph
Abstract
This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are interconnected and provide tight bounds for any n-vertex maximal outerplanar graph: the 2d-guarding number, g2d(n) = n/5; the 2d-distance domination number, gamma2d(n) = n/5; and the 2d-distance vertex cover number, beta2d(n) = n/4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.