The number of maximum independent sets in graphs
檔案
本條目沒有附加檔案。
日期
2000-12-01
類型
系所
期刊名稱
TAIWANESE JOURNAL OF MATHEMATICS
卷期與頁次
第 4 卷第 4 期,頁 685–695
ISSN
1027-5487
語言
英文
摘要
In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs and triangle-free graphs. Extremal graphs achieving the maximum values are also given.