在這篇論文中，我們根據局部連通和局部補連通性質將圖分類，計算在 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.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0098751004 |
| Creators | 陳玫芳 |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 英文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0022 seconds