| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.author (Authors) | 陳玫芳 | zh_TW |
| dc.creator (作者) | 陳玫芳 | zh_TW |
| dc.date (日期) | 2010 | en_US |
| dc.date.accessioned | 5-Oct-2011 16:18:31 (UTC+8) | - |
| dc.date.available | 5-Oct-2011 16:18:31 (UTC+8) | - |
| dc.date.issued (上傳時間) | 5-Oct-2011 16:18:31 (UTC+8) | - |
| dc.identifier (Other Identifiers) | G0098751004 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/51471 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 應用數學研究所 | zh_TW |
| dc.description (描述) | 98751004 | zh_TW |
| dc.description (描述) | 99 | zh_TW |
| dc.description.abstract (摘要) | 在這篇論文中，我們根據局部連通和局部補連通性質將圖分類，計算在 Harary 圖裡大小為 2k - 1 和 2k 邊切集的個數，和證明當圖形有最大的最小邊度數和最小點度數差，一些關於度數為 1 的點個數性質。 | zh_TW |
| dc.description.abstract (摘要) | 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. | en_US |
| dc.description.tableofcontents | Abstract ii中文摘要 iii1 Introduction 12 Some Properties of Locally Connected Graphs and Locally Coconnected Graphs 23 The Number of Edge Cuts of k-regular Graphs 74 The Maximum Di fference of the Minimum Edge Degree and theMinimum Vertex Degree of a Graph 235 Open Problems and Further Directions of Studies 28References 29 | zh_TW |
| dc.language.iso | en_US | - |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0098751004 | en_US |
| dc.subject (關鍵詞) | 局部連通圖 | zh_TW |
| dc.subject (關鍵詞) | 邊切集 | zh_TW |
| dc.subject (關鍵詞) | 限制邊連通數 | zh_TW |
| dc.subject (關鍵詞) | Locally Connected Graphs | en_US |
| dc.subject (關鍵詞) | Edge Cuts | en_US |
| dc.subject (關鍵詞) | Restricted Edge Connectivity | en_US |
| dc.title (題名) | 關於邊連通數和邊度數的問題 | zh_TW |
| dc.title (題名) | Some topics on edge connectivity and edge degrees | en_US |
| dc.type (資料類型) | thesis | en |
| dc.relation.reference (參考文獻) | [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. | zh_TW |
| dc.relation.reference (參考文獻) | [2] O. Jianping and F. Zhang, Super restricted edge connectivity of regular graphs, Graphs and Combinatorics, 21 (2005), pp. 459-467. | zh_TW |
| dc.relation.reference (參考文獻) | [3] E. G. Kohler, Graphs Without Asteroidal Triples, PhD thesis, Technischen Universitat Berlin, 1999. | zh_TW |
| dc.relation.reference (參考文獻) | [4] D. B. West, Introduction to Graph Theory, Prentice Hall, 2001. | zh_TW |
| dc.relation.reference (參考文獻) | [5] J.-M. Xu and K.-L. Xu, On restricted edge-connectivity of graph, Discrete Mathematics, 243 (2002), pp. 291-298. | zh_TW |
