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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Jou, M., & Chang, G. (2000). The number of maximum independent sets in graphs. TAIWANESE JOURNAL OF MATHEMATICS, 4(4), 685–695. https://ir.lib.nycu.edu.tw/handle/11536/30111

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30111