Maximal independent sets in graphs with at most one cycle

檔案

日期

1997-11-27

期刊名稱

DISCRETE APPLIED MATHEMATICS

摘要

In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for graphs with at most one cycle but not necessarily connected are also given.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Jou, M., & Chang, G. (1997). Maximal independent sets in graphs with at most one cycle. DISCRETE APPLIED MATHEMATICS, 79(1-3), 67–73. https://ir.lib.nycu.edu.tw/handle/11536/185

BibTeX RIS

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

分享

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