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/32569
DC FieldValueLanguage
dc.contributor.advisor李陽明zh_TW
dc.contributor.author吳文智zh_TW
dc.contributor.authorWu, Wen Chihen_US
dc.creator吳文智zh_TW
dc.creatorWu, Wen Chihen_US
dc.date2005en_US
dc.date.accessioned2009-09-17T05:46:05Z-
dc.date.available2009-09-17T05:46:05Z-
dc.date.issued2009-09-17T05:46:05Z-
dc.identifierG0091751009en_US
dc.identifier.urihttps://nccur.lib.nccu.edu.tw/handle/140.119/32569-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學研究所zh_TW
dc.description91751009zh_TW
dc.description94zh_TW
dc.description.abstract樹是一個沒有迴路的連接圖。而4-caterpillar是一種樹，它擁有單一路徑連接到數個長度為3的路徑的端點。一個有n個邊的無向圖G的優美標法是一個從G的點到{0,1,2,...,n}的一對一函數，使得每一個邊的標號都不一樣，其中，邊的標號是兩個相鄰的點的編號差的絕對值。在這篇論文當中，我們最主要的目的是使用一個演算法來完成4-caterpillars的優美標法。zh_TW
dc.description.abstractA tree is connected acyclic graph. A 4-caterpillar is a tree with a single path only incident to the end-vertices of paths of length 3. A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0,1,2,...,n} such that the induced edge labels are all distinct, where the edge label is the difference between two endvertex labels. In this thesis, our main purpose is to use an algorithm to yield graceful labellings of 4-caterpillars.en_US
dc.description.tableofcontents書名頁\n謝辭\n英文摘要\n中文摘要\n目次\n第一章 Introduction\n第二章 Main result\n第三章 Further studies in the future\n參考文獻zh_TW
dc.format.extent139337 bytes-
dc.format.extent88506 bytes-
dc.format.extent71119 bytes-
dc.format.extent122623 bytes-
dc.format.extent147234 bytes-
dc.format.extent151700 bytes-
dc.format.extent480260 bytes-
dc.format.extent66830 bytes-
dc.format.extent139904 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#G0091751009en_US
dc.subject樹zh_TW
dc.subject優美圖zh_TW
dc.subjectTreesen_US
dc.subjectgraceful labellingen_US
dc.subject4-Caterpillarsen_US
dc.subject4-starsen_US
dc.title4-Caterpillars的優美標法zh_TW
dc.titleGraceful Labelings of 4-Caterpillarsen_US
dc.typethesisen
dc.relation.reference[1] R.E. Aldred and B.D. McKay, Graceful and harmoniouszh_TW
dc.relation.referencelabellings of trees, Bull. Inst. Combin. Appl., 23 (1998) 69-72.zh_TW
dc.relation.reference[2] R.E. Aldred, J. Siran and M. Siran, A Note on the number of graceful labellings of paths, Discrete Math., 261 (2003) 27-30.zh_TW
dc.relation.reference[3] J.C. Bermond, Graceful graphs, radio antennae and French windmills, Graph Theory and Combinatorics, Pitman, London (1979) 18-37.zh_TW
dc.relation.reference[4] J.C. Bermond and D. Sotteau, Graph decompositions and G-design, Proc. 5th British Combinatorics Conference, 1975, Congress. Number., XV (1976) 53-72.zh_TW
dc.relation.reference[5] V. Bhat-Nayak and U. Deshmukh, New families of graceful banana trees, Proc. Indian Acad. Sci Math. Sci., 106 (1996) 201-216.zh_TW
dc.relation.reference[6] G. S. Bloom, A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful, Ann. N. Y. Acad. Sci., 326 (1979) 32-51.zh_TW
dc.relation.reference[7] C.P. Bonnington and J. Siran, Bipartite labelling of trees with maximum degree three, Journal of Graph Theory, 31 (1999) 37-56.zh_TW
dc.relation.reference[8] L. Brankovic, A. Rose and J. Siran, Labelling of trees with maximum degree three and improved bound, preprint, (1999).zh_TW
dc.relation.reference[9] H.J. Broersma and C. Hoede, Another equivalent of the graceful tree conjecture, Ars Combinatoria, 51 (1999) 183-192.zh_TW
dc.relation.reference[10] M. Burzio and G. Ferrarese, The subdivision graph of a graceful tree is a graceful tree, Discrete Mathematices, 181 (1998) 275-281.zh_TW
dc.relation.reference[11] I. Cahit, R. Cahit, On the graceful numbering of spanning trees, Information Processing Letters, vol. 3, no. 4, pp. (1998) 115-118.zh_TW
dc.relation.reference[12] Y.-M. Chen, Y.-Z. Shih, 2-Caterpillars are graceful. Preprint, (2006).zh_TW
dc.relation.reference[13] W.C. Chen, H.I. Lu and Y.N. Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bulletin of Mathematics, 21 (1997) 337-348.zh_TW
dc.relation.reference[14] P. Hrnciar, A. Havier, All trees of diameter five are graceful. Discrete Mathematices, 31 (2001) 279-292.zh_TW
dc.relation.reference[15] K.M. Koh, D.G. Rogers and T. Tan, A graceful arboretum: A survey of graceful trees, in Proceedings of Franco-Southeast Asian Conference, Singapore, May 1979, 2 278-287.zh_TW
dc.relation.reference[16] D. Morgan, Graceful labelled trees from Skolem sequences, Proc. of the Thirty-first Southeastern Internat, Conf, on Combin., Graph Theory, Computing (Boca Raton, FL, 2000) and Congressus Numerantium, (2000) 41-48.zh_TW
dc.relation.reference[17] D. Morgan, All lobsters with perfect matchings are graceful, Electronic Notes in Discrete Mathematices, 11 (2002), 503-508.zh_TW
dc.relation.reference[18] A.M. Pastel and H. Raynaud, Les oliviers sont gracieux, Colloq. Grenoble, Publications Universite de Grenoble, (1978).zh_TW
dc.relation.reference[19] A. Rose, On certain valuations of the vertices of graph, Theory of Graphs, International Symposium, Rome, July 1996, Gordon and Breach, N.Y. and Dunod Paris (1967) 349-355.zh_TW
dc.relation.reference[20] J.-G. Wang, D.J. Jin, X.-G. Lu and D. Zhang, The gracefulness of a class of lobster Trees, Mathematical Computer Modelling, 20 (1994) 105-110.zh_TW
dc.relation.reference[21] D.B. West, Introduction to Graph Theory, Prentice-Hall, Inc. (1996).zh_TW
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.languageiso639-1en_US-
item.openairetypethesis-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
Appears in Collections:學位論文
Files in This Item:
File Description SizeFormat
75100901.pdf136.07 kBAdobe PDF2View/Open
75100902.pdf86.43 kBAdobe PDF2View/Open
75100903.pdf69.45 kBAdobe PDF2View/Open
75100904.pdf119.75 kBAdobe PDF2View/Open
75100905.pdf143.78 kBAdobe PDF2View/Open
75100906.pdf148.14 kBAdobe PDF2View/Open
75100907.pdf469 kBAdobe PDF2View/Open
75100908.pdf65.26 kBAdobe PDF2View/Open
75100909.pdf136.62 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


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