查詢結果分析
來源資料
相關文獻
- Alternative Proofs of Results on the Number of Independent Sets in Trees
- The Number of Maximal Independent Sets in Triangle-Free Quasi-Tree Graphs
- The Number of Independent Sets in Forests Having No Isolated Vertices with a Given Size
- The Number of Independent Sets in a k-component Graph
- Forests with the Tgird Largest Number of Maximal Independent Sets
- Minimal Vertex Covers in Trees
- 太極圖與DNA
- 「太極圖說」與宋學
- 從「太極圖說」到「中和圖說」--也談中國哲學的重建問題
- Independent Sets on k-Connected Graphs
頁籤選單縮合
題名 | Alternative Proofs of Results on the Number of Independent Sets in Trees=樹圖中獨立集個數結果的另一種證明 |
---|---|
作者 | 周敏貞; 林正忠; Jou, Min-jen; Lin, Jenq-jong; |
期刊 | 嶺東學報 |
出版日期 | 20150600 |
卷期 | 37 2015.06[民104.06] |
頁次 | 頁207-216 |
分類號 | 319.76 |
語文 | eng |
關鍵詞 | 獨立集; 樹圖; 極圖; 斐波那契數; 三腳架圖; Independent set; Tree; Extremal graph; Fibonacci number; Tripod graph; |
中文摘要 | 圖形G=(V,E)中獨立集為點集V之一子集合S,且使得S中任兩點在G中均不相連。在本篇論文中,我們以另一種較簡易方法得到樹圖中獨立集個數的最大、第二大、最小及第二小數值等已知的結果。除此之外,我們亦描繪出達到這些數值之所有極圖。 |
英文摘要 | In a graph G=(V, E), an independent set is a subset S of V such that no two vertices in S are adjacent. In this paper, we will give alternative proofs for the solutions to readily determine the largest, second largest and the smallest, second smallest number of independent sets among all trees. Extremal graphs achieving these values are also given. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。