查詢結果分析
來源資料
相關文獻
- The Number of Independent Sets in a k-component Graph
- Independent Sets on k-Connected Graphs
- 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
- Forests with the Tgird Largest Number of Maximal Independent Sets
- 太極圖與DNA
- 「太極圖說」與宋學
- 從「太極圖說」到「中和圖說」--也談中國哲學的重建問題
- 太極原理與養生
頁籤選單縮合
題名 | The Number of Independent Sets in a k-component Graph=k-連通元件圖形之獨立集個數 |
---|---|
作者 | 周敏貞; 林正忠; | 書刊名 | 嶺東學報 |
卷期 | 31 2012.06[民101.06] |
頁次 | 頁29-35 |
分類號 | 319.9 |
關鍵詞 | 連通圖形; 連通元件; 獨立集; 極圖; Connected graph; Component; Indepedent set; Extremal graph; |
語文 | 英文(English) |
中文摘要 | 圖形G =(V, E)中之獨立集為點集V之一子集合S,且使得S中任兩點在G中均不相連。圖形G中之最大連通子圖形稱之連通元件。在本篇論文中,我們確定了k-連通元件圖形中獨立集之第一及第二大數值。除此之外,我們亦描繪出達到這些數值之極圖。 |
英文摘要 | In a graph G = (V; E), an independent set is a subset S of V (G) such that no two vertices in S are adjacent. A maximal connected subgraph of G is called a component of G. In this paper, we study the problem of determining the largest and the second largest numbers of independent sets among all graphs with k ≥ 2 components. Extremal graphs achieving these values are also given. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。