Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/87108
題名: | 圖的全星數 The total star number of graphs |
作者: | 呂吉祥 | 貢獻者: | 張宜武 呂吉祥 |
關鍵詞: | Multiple-star representation Total star number |
日期: | 1996 | 上傳時間: | 28-Apr-2016 | 摘要: | A multiple-star representation of a simple graph G assigns each vertex a union of stars in a host tree, such that vertices are adjacent if and only if their assigned sets intersect. The total star number S(G) is the minimum of the total number of stars used in any such representation of G. We obtain the maximum value of S(G) for m-edge connected graphs: m + 1, n-vertex graphs: [n<sup>2</sup> + 1)/ 4], and n-vertex outer-planar graphs: [3n /2-l] | 描述: | 碩士 國立政治大學 應用數學系 84751012 |
資料來源: | http://thesis.lib.nccu.edu.tw/record/#B2002002524 | 資料類型: | thesis |
Appears in Collections: | 學位論文 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
index.html | 115 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.