Maximal Independent Sets In Graphs With At Most r Cycles

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
31 pages, 11 figures, Latex, see related papers at http://www.math.msu.edu/~sagan, split paper into two parts

Keywords

Combinatorics, 05C35 (Primary) 05C69 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/64499

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0207100
 http://arxiv.org/abs/math/0207100

Collections

arXiv