查詢結果分析
來源資料
相關文獻
- The Number of Maximal Independent Sets in Triangle-Free Quasi-Tree Graphs
- Forests with the Tgird Largest Number of Maximal Independent Sets
- The Number of Independent Sets in Forests Having No Isolated Vertices with a Given Size
- Alternative Proofs of Results on the Number of Independent Sets in Trees
- 以賽局理論設計MANET最大獨立集合自我穩定協定
- The Number of Independent Sets in a k-component Graph
- Minimal Vertex Covers in Trees
- 太極圖與DNA
- 「太極圖說」與宋學
- 從「太極圖說」到「中和圖說」--也談中國哲學的重建問題
頁籤選單縮合
題名 | Forests with the Tgird Largest Number of Maximal Independent Sets=林圖中最大獨立集之第三大數值 |
---|---|
作者 | 周敏貞; 林正忠; Jou, Min-jen; Lin, Jenq-jong; |
期刊 | 嶺東學報 |
出版日期 | 20100600 |
卷期 | 27 2010.06[民99.06] |
頁次 | 頁203-211 |
分類號 | 319.9 |
語文 | eng |
關鍵詞 | 獨立集; 最大獨立集; 林圖; 極圖; Independent sets; Maximal independent sets; Trees; Forests; Extremal graphs; |
中文摘要 | G=(V, E)爲一簡單且無方向圖形。圖形G之獨立集爲點集V之一子集合S,且使得S中任兩點在G中均不相連。若一獨立集不爲其他獨立集之真子集,則稱此獨立集爲最大獨立集。在本篇論文中,我們確定了林圖中最大獨立集之第三大數值。除此之外,我們亦描繪出達到此值之所有極圖。 |
英文摘要 | Let G = (V, E) be a simple undirected graph. An independent set is a subset S of V such that no two vertices in S are adjacent. A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the third largest number of maximal independent sets among all forests. We also characterize those extremal graphs achieving this value. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。