The number of maximal independent sets in connected triangle-free graphs

Discrete Mathematics

Volumn 197-198, Issue , 1999, Pages 169-178

  Chang, Gerard J ^a   Jou, Min Jen ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Connected graph; Cycle; Independent set; Leaf; Maximal independent set; Neighborhood; Path; Triangle; Union

Indexed keywords

EID: 0041154229     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(99)90057-2     Document Type: Article

References (27)

1. S.C. Chang, Y.N. Yeh, The cardinality of the collection of maximum independent sets of a graph, Adv. Appl. Math 18 (1997) 286-299.
2. eme session, Institute de Recherche Mathématique Avancée Pub., Strasbourg, France, 1984, 48-52.
3. C. Fan, J. Liu, On clique of graphs, in: Y. Alavi, F.R.K. Chung, R.L. Graham, D.F. Hsu (Eds.), Graph Theory, Combinatorics, Algorithms and Applications, SIAM, Philadelphia, PA, 1991, 140-150.
4. M. Farber, M. Hujter, Z. Tuza, An upper bound on the number of cliques in a graph, Networks 23 (1993) 207-210.
5. Z. Furedi, The number of maximal independent sets in connected graphs, J. Graph Theory 11 (1987) 463-470.
6. J.R. Griggs, C.M. Grinstead, unpublished result, 1986.
7. J.R. Griggs, C.M. Grinstead, D.R. Guichard, The number of maximal independent sets in a connected graph, Discrete Math. 68 (1988) 211-220.
8. B. Hedman, The maximum number of cliques in dense graphs, Discrete Math. 54 (1985) 161-166.
9. G. Hopkins, W. Staton, Graphs with unique maximum independent sets, Discrete Math. 57 (1985) 245-251.
10. M. Hujter, Z. Tuza, The number of maximal independent sets in triangle-free graphs, SIAM J. Discrete Math. 6 (1993) 284-288.
11. D.S. Johnson, M. Yannakakis, C.H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119-123.
12. M.J. Jou, The number of maximal independent sets in graphs, Master Thesis, Dept. of Math.. National Central University, Taiwan, 1990.
13. M.J. Jou, Counting independent sets, Ph.D. Thesis, Dept. of Applied Math., National Chiao Tung University, Taiwan, 1996.
14. M.J. Jou, G.J. Chang, Maximal independent sets in graphs with at most one cycle, Discrete Appl. Math. 79 (1997) 67-73.
15. M.J. Jou, G.J. Chang, Survey on counting maximal independent sets, in: S. Tangmance and E. Schulz (Eds.), Proc. 2nd Asian Mathematical Conf., World Scientific, 1995, 265-275.
16. M.J. Jou, G.J. Chang, Counting maximum independent sets, submitted.
17. M.J. Jou, G.J. Chang, Algorithmic aspects of counting independent sets, submitted.
18. M.J. Jou, G.J. Chang, C. Lin, T.H. Ma, A finiteness theorem for maximal independent sets, Graphs Combin. 12 (1996) 321-326.
19. S.B. Lin, C. Lin, Trees and forests of the same order with large and small independent indices, Chinese J. Math. 32 (1995) 199-210.
20. V. Linek, Bipartite graphs can have any number of independent sets, Discrete Math. 76 (1989) 131-136.
21. J. Liu, Maximal and maximum independent sets in graphs, Ph.D. Dissertation, Dept. of Math. and Statistics, Western Michigan University, 1992.
22. J. Liu, Maximal independent sets in bipartite graphs, J. Graph Theory 17 (1993) 495-507.
23. A. Meir, J.W. Moon, On maximal independent sets of nodes in trees, J. Graph Theory 12 (1988) 265-283.
24. J.W. Moon, L. Moser, On cliques in graphs, Israel J. Math. 3 (1965) 23-28.
25. B.E. Sagan, A note on independent sets in trees, SIAM J. Discrete Math. 1 (1988) 105-108.
26. H.S. Wilf, The number of maximal independent sets in & tree, SIAM J. Algebraic Discrete Methods 7 (1986) 125-130.
27. J. Zito, The structure and maximum number of maximum independent sets in trees, J. Graph Theory 15 (1991) 207-221.