Independent sets versus 4-dominating sets in outerplanar graphs
Abstract
We show that the number of independent sets in every outerplanar graph is greater than the number of its 4-dominating sets.
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.