標題: The number of maximum independent sets in graphs
作者: Jou, MJ
Chang, GJ
應用數學系
Department of Applied Mathematics
關鍵字: independent set;tree;forest;connected graph;cycle;triangle;leaf;distance
公開日期: 1-Dec-2000
摘要: 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.
URI: http://hdl.handle.net/11536/30111
ISSN: 1027-5487
期刊: TAIWANESE JOURNAL OF MATHEMATICS
Volume: 4
Issue: 4
起始頁: 685
結束頁: 695
Appears in Collections:Articles