Maximal Independent Sets In Graphs With At Most r Cycles
Abstract
We find the maximum number of maximal independent sets in two families of graphs: all graphs with n vertices and at most r cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.