1. NCCU Academic Hub
  2. 理學院
  3. 應用數學系
  4. 學位論文
Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/51471
DC FieldValueLanguage
dc.contributor.advisor張宜武zh_TW
dc.contributor.author陳玫芳zh_TW
dc.creator陳玫芳zh_TW
dc.date2010en_US
dc.date.accessioned2011-10-05T08:18:31Z-
dc.date.available2011-10-05T08:18:31Z-
dc.date.issued2011-10-05T08:18:31Z-
dc.identifierG0098751004en_US
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/51471-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學研究所zh_TW
dc.description98751004zh_TW
dc.description99zh_TW
dc.description.abstract在這篇論文中，我們根據局部連通和局部補連通性質將圖分類，計算在 Harary 圖裡大小為 2k - 1 和 2k 邊切集的個數，和證明當圖形有最大的最小邊度數和最小點度數差，一些關於度數為 1 的點個數性質。zh_TW
dc.description.abstractIn 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.tableofcontentsAbstract ii\n中文摘要 iii\n1 Introduction 1\n2 Some Properties of Locally Connected Graphs and Locally Coconnected Graphs 2\n3 The Number of Edge Cuts of k-regular Graphs 7\n4 The Maximum Di fference of the Minimum Edge Degree and the\nMinimum Vertex Degree of a Graph 23\n5 Open Problems and Further Directions of Studies 28\nReferences 29zh_TW
dc.language.isoen_US-
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#G0098751004en_US
dc.subject局部連通圖zh_TW
dc.subject邊切集zh_TW
dc.subject限制邊連通數zh_TW
dc.subjectLocally Connected Graphsen_US
dc.subjectEdge Cutsen_US
dc.subjectRestricted Edge Connectivityen_US
dc.title關於邊連通數和邊度數的問題zh_TW
dc.titleSome topics on edge connectivity and edge degreesen_US
dc.typethesisen
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
item.languageiso639-1en_US-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.cerifentitytypePublications-
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.openairetypethesis-
Appears in Collections:學位論文
Files in This Item:
File SizeFormat
100401.pdf1.54 MBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.