查詢結果分析
來源資料
相關文獻
- Minimal Vertex Covers in Trees
- The Number of Maximal Independent Sets in Triangle-Free Quasi-Tree Graphs
- Alternative Proofs of Results on the Number of Independent Sets in Trees
- 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
- 「太極圖說」與宋學
- 從「太極圖說」到「中和圖說」--也談中國哲學的重建問題
- Independent Sets on k-Connected Graphs
- 太極原理與養生
頁籤選單縮合
題名 | Minimal Vertex Covers in Trees=樹圖中之最小點覆蓋 |
---|---|
作者 | 林正忠; 周敏貞; Lin, Jenq-Jong; Jou, Min-Jen; |
期刊 | 嶺東學報 |
出版日期 | 20071200 |
卷期 | 22 2007.12[民96.12] |
頁次 | 頁185-194 |
分類號 | 319.76 |
語文 | eng |
關鍵詞 | 鄰集; 樹圖; 林圖; 最小點覆蓋; 極圖; Neighborhood; Tree; Forest; Minimal vertex cover; Extremal graph; |
中文摘要 | 在本篇論文中,我們確定了點數為n的樹圖中最小點覆蓋之最大數。除此之外,我們亦描繪出達到此最大值之極圖;並針對林圖給定相對的結果。 |
英文摘要 | In this paper, we will determine the largest number of minimal vertex covers in a tree of order n≥2. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for forests are also given. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。