Maximal outerplanar graphs satisfy γ_{×2}(G) ≤ (n + k)/2 where k is the number of distant consecutive pairs on the outer cycle.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
Maximal outerplanar graphs satisfy γ_{×2}(G) ≤ (n + k)/2 where k is the number of distant consecutive pairs on the outer cycle.