Maximal independent sets in graphs with at most r cycles

Journal of Graph Theory

Volumn 53, Issue 4, 2006, Pages 270-282

  Goh, Chee Ying ^a   Koh, Khee Meng ^a   Sagan, Bruce E ^b   Vatter, Vincent R ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b MICHIGAN STATE UNIVERSITY   (United States)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Cycle; Ear decomposition; Maximal independent set

Indexed keywords

NUMBER THEORY; NUMERICAL METHODS; SET THEORY;

CYCLE; EAR DECOMPOSITION; MAXIMAL INDEPENDENT SET;

GRAPH THEORY;

EID: 33845562807     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20185     Document Type: Article

References (10)

1. R. Diestel, Graph theory, Graduate texts in math, Vol. 173, Springer-Verlag, New York, NY (1997).
2. Z. Furedi, The number of maximal independent sets in connected graphs, J Graph Theory 11 (1987), 463-470.
3. J. R. Griggs, C. M. Grinstead, and D. R. Guichard, The number of maximal independent sets in a connected graph, Discrete Math 68 (1988), 211-220.
4. M. J. Jou and G. J. Chang, Maximal independent sets in graphs with at most one cycle, Discrete Appl Math 79 (1997), 67-73.
5. J. W. Moon and L. Moser, On cliques in graphs, Isr J Math 3 (1965), 23-28.
6. B. E. Sagan, A note on independent sets in trees, SIAM J Discrete Math 1 (1988), 105-108.
7. B. E. Sagan and V. R. Vatter, Maximal and maximum independent sets in graphs with at most r cycles, J Graph Theory 2006, DOI/10.1002/jgt.20186.
8. D. West, Introduction to Graph Theory (2nd edn), Prentice Hall, Upper Saddle River, NJ, 2001.
9. H. Whitney, Congruent graphs and the connectivity of graphs, Am J Math 54 (1932), 150-168.
10. H. S. Wilf, The number of maximal independent sets in a tree, SIAM J Alg Discrete Methods 7 (1986), 125-130.