The number of maximum independent sets in graphs

Taiwanese Journal of Mathematics

Volumn 4, Issue 4, 2000, Pages 685-695

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

^a LING TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Connected graph; Cycle; Distance; Forest; Independent set; Leaf; Tree; Triangle

Indexed keywords

EID: 0039931561     PISSN: 10275487     EISSN: None     Source Type: Journal    
DOI: 10.11650/twjm/1500407302     Document Type: Article

References (28)

1. G. J. Chang and M. J. Jou, The number of maximal independent sets in connected triangle-free graphs, Discrete Math. 197/198 (1999), 169-178.
2. eme session, R. König, ed., Institute de Recherche Mathématique Avancée Pub., Strabourg, France, 1984, pp.48-52.
3. C. Fan and J. Liu, On clique of graphs, in: Graph Theory, Combinatorics, Algorithms and Applications, Y. Alavi, F. R. K. Chang, R. L. Graham and D. F. Hsu, eds., SIAM, Philadelphia, PA, 1991, pp. 140-150.
4. M. Farber, M. Hujter and Z. Tuza, An upper bound on the number of cliques in graph, Networks 23 (1993), 207-210.
5. Z. Fudie;redi, The number of maximal independent sets in connected graphs, J. Graph Theory 11 (1987), 463-470.
6. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
7. J. R. Griggs and C. M. Grinstead, unpublished result, 1986.
8. 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.
9. B. Hedman, The maximum number of cliques in dense graphs, Discrete Math. 54 (1985), 161-166.
10. G. Hopkins and W. Staton, Graphs with unique maximum independent sets, Discrete Math. 57 (1985), 245-251.
11. M. Hujter and Z. Tuza, The number of maximal independent sets in triangle-free graphs, SIAM J. Discrete Math. 6 (1993), 284-288.
12. D. S. Johnson, M. Yannakakis and C. H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988), 119-123.
13. M. J. Jou, The Number of Maximal Independent Sets in Graphs, Master Thesis, Dept. of Math., National Center University, Taiwan, 1990.
14. M. J. Jou, Counting Independent Sets, Ph.D Dissertation, Dept. of Applied Math., National Chiao Tung University, Taiwan, 1996.
15. M. J. Jou and G. J. Chang, Maximal independent sets in graphs with at most one cycle, Discrete Applied Math. 79 (1997), 67-73.
16. M. J. Jou and G. J. Chang, Survey on counting maximal independent sets, in: Proceedings of the Second Asian Mathematical Conference, S. Tangmance and E. Schulz eds., World Scientific, Singapore, 1995, pp.265-275.
17. M. J. Jou and G. J. Chang, Algorithmic aspects of counting independent sets, Ars Combin., to appear.
18. M. J. Jou, G. J. Chang, C. Lin and T. H. Ma, A finiteness theorem for maximal independent sets, Graphs Combin. 12 (1996), 321-326.
19. S. B. Lin and 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. R. E. Miller and D. E. Muller, A Problem of Maximum Consistent Subsets, IBM Research Report RC-240, J. T. Watson Research Center, Yorktown Heights, New York, 1960.
24. A. Meir and J. W. Moon, On maximal independent sets of nodes in trees, J. Graph Theory 12 (1988), 265-283.
25. J. W. Moon and L. Moser, On cliques in graphs, Israel J. Math. 3 (1965), 23-28.
26. B. E. Sagan, A note on independent sets in trees, SIAM J. Discrete Math. 1 (1988), 105-108.
27. H. S. Wilf, The number of maximal independent sets in a tree, SIAM J. Algebraic Discrete Methods 7 (1986), 125-130.
28. J. Zito, The structure and maximum number of maximum independent sets in trees, J. Graph Theory 15 (1991), 207-221.