Maximal Independent Sets In Graphs With At Most r Cycles

Simple item page
dc.creatorGoh, Chee Ying
dc.creatorKoh, Khee Meng
dc.creatorSagan, Bruce E.
dc.creatorVatter, V.
dc.date2002-07-11
dc.date2005-04-30
dc.date.accessioned2026-07-07T04:49:38Z
dc.date.available2026-07-07T04:49:38Z
dc.descriptionWe 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.
dc.description31 pages, 11 figures, Latex, see related papers at http://www.math.msu.edu/~sagan, split paper into two parts
dc.identifierhttps://arxiv.org/abs/math/0207100
dc.identifierhttp://arxiv.org/abs/math/0207100
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64499
dc.subjectCombinatorics
dc.subject05C35 (Primary) 05C69 (Secondary)
dc.titleMaximal Independent Sets In Graphs With At Most r Cycles
dc.typetext

Files

Collections

arXiv