The number of maximal independent sets in connected triangle-free graphs

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

1999-02-28

類型

期刊名稱

DISCRETE MATHEMATICS

卷期與頁次

第 197 卷第 1-3 期,頁 169–178

ISSN

0012-365X

語言

英文

摘要

Erdos and Moser raised the problem of determining the largest number of maximal independent sets of a general graph G of order n and those graphs achieving this largest number. This problem was solved by Erdos, and later Moon and Moser. It then was extensively studied for various classes of graphs, including trees, forests, (connected) graphs with at most one cycle, bipartite graphs, connected graphs, k-connected graphs and triangle-free graphs. This paper studies the problem for connected triangle-free graphs. In particular, we prove that every connected triangle-free graph of order n greater than or equal to 22 has at most 5 . 2((n-6)/2) (respectively, 2((n-1)/2)) maximal independent sets if n is even (respectively, odd). Extremal graphs achieving this maximum value are also characterized. (C) 1999 Elsevier Science B.V. All rights reserved.

所屬典藏

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

引用此條目

Chang, G., & Jou, M. (1999). The number of maximal independent sets in connected triangle-free graphs. DISCRETE MATHEMATICS, 197(1-3), 169–178. https://doi.org/10.1016/S0012-365X(98)00231-3

BibTeX RIS

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

分享

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