Maximal independent sets in graphs with at most r cycles

We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family is all graphs of the first family which are connected and satisfy n ≥ 3r. © 2006 Wiley Periodicals, Inc. J Graph Theory 53...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2006-12, Vol.53 (4), p.270-282
Hauptverfasser:	Ying, Goh Chee, Meng, Koh Khee, Sagan, Bruce E., Vatter, Vincent R.
Format:	Artikel
Sprache:	eng
Schlagworte:	cycle ear decomposition maximal independent set
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!