Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/51471| 題名: | 關於邊連通數和邊度數的問題 Some topics on edge connectivity and edge degrees |
作者: | 陳玫芳 | 貢獻者: | 張宜武 陳玫芳 |
關鍵詞: | 局部連通圖 邊切集 限制邊連通數 Locally Connected Graphs Edge Cuts Restricted Edge Connectivity |
日期: | 2010 | 上傳時間: | 5-Oct-2011 | 摘要: | 在這篇論文中，我們根據局部連通和局部補連通性質將圖分類，計算在 Harary 圖裡大小為 2k - 1 和 2k 邊切集的個數，和證明當圖形有最大的最小邊度數和最小點度數差，一些關於度數為 1 的點個數性質。 In this thesis, we classify some graphs into locally coconnected graphs or locally connected graphs, compute the number of its edge cuts of size 2k - 1 and 2k in a Harary graph, and show some properties of the number of vertices of degree 1 when the graph has the maximum difference of minimum edge degree and minimum vertex degree. |
參考文獻: | [1] A.-H. Esfahanian and S. L. Hakimi, On computing a conditional edge-connectivity of a graph, Information Processing Letters, 27 (1988), pp. 195-199. [2] O. Jianping and F. Zhang, Super restricted edge connectivity of regular graphs, Graphs and Combinatorics, 21 (2005), pp. 459-467. [3] E. G. Kohler, Graphs Without Asteroidal Triples, PhD thesis, Technischen Universitat Berlin, 1999. [4] D. B. West, Introduction to Graph Theory, Prentice Hall, 2001. [5] J.-M. Xu and K.-L. Xu, On restricted edge-connectivity of graph, Discrete Mathematics, 243 (2002), pp. 291-298. |
描述: | 碩士 國立政治大學 應用數學研究所 98751004 99 |
資料來源: | http://thesis.lib.nccu.edu.tw/record/#G0098751004 | 資料類型: | thesis |
| Appears in Collections: | 學位論文 |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| 100401.pdf | 1.54 MB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.