Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/89761| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 李陽明 | zh_TW |
| dc.contributor.author | 洪國銘 | zh_TW |
| dc.creator | 洪國銘 | zh_TW |
| dc.date | 1991 | en_US |
| dc.date | 1990 | en_US |
| dc.date.accessioned | 2016-05-02T09:07:23Z | - |
| dc.date.available | 2016-05-02T09:07:23Z | - |
| dc.date.issued | 2016-05-02T09:07:23Z | - |
| dc.identifier | B2002005097 | en_US |
| dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/89761 | - |
| dc.description | 碩士 | zh_TW |
| dc.description | 國立政治大學 | zh_TW |
| dc.description | 應用數學系 | zh_TW |
| dc.description.abstract | 論文摘要 | zh_TW |
| dc.description.abstract | Abstract | en_US |
| dc.description.tableofcontents | Context\r\nAbstract 2\r\n§1. Introduction 3\r\n§2. Operator \"⊙\" 6 \r\n2.1 Operator \"⊙\" on cycles 7\r\n2.2 Operator \"⊙\" on complete graphs 23\r\n2.3 Operator \"⊙\" on complete n-partite graphs 26\r\n§3. Operator \"★\" 31\r\n3.1 Operator \"★\"on [0,0] strongly cordial graphs 32\r\n3.2 Operator \"★\"on [0,1] n [0,-1] 33\r\n3.3 Operator \"★\"on [1,0] n [1, -2] 33\r\n3.4 Operator \"★\",. on [1,1] 35\r\n3.5 Operator \"★\"on [1,-1] 35\r\n3.6 Operator \"★\"on some graphs 36\r\n§4. Operator\" + \" 42\r\n4.1 Operator \" + \" on [0,0] strongly cordial graph 42\r\n4.2 Operator \" + \" on [0,1] n [0,-1 ]42\r\n4.3 Operator \"+\" on [1, 0] n [1,-2] 42\r\n4.4 Operator \" + \" on [1,1] n [1,-l] 43\r\n4.5 Operator \" +\" on path 44\r\n4.6 Operator \"+\" on some graphs 46\r\n§5. Operator \" ?\" 50\r\n5.1 Operator \"? \"on some graphs 50\r\n§6. Operator\" ? \" 55\r\n6.1 Operator\" ?\" on some graphs 56\r\nReference: 62 | zh_TW |
| dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#B2002005097 | en_US |
| dc.subject | cordial labeling | en_US |
| dc.subject | link (0) | en_US |
| dc.subject | corona (*) | en_US |
| dc.subject | join (+) | en_US |
| dc.subject | bridge (ʉ) | en_US |
| dc.subject | newcorona (©) | en_US |
| dc.title | 在Cordial圖上的一些運算子 | zh_TW |
| dc.title | Some operatiors on cordial graph | en_US |
| dc.type | thesis | en_US |
| dc.relation.reference | Reference:\r\n\r\n[1] M. Benson and Sin-Min Lee, \"On cordialness of regular windmill graphs, Congressus Numerantium,68( 1989),49 - 58.\r\n[2] J . A. Bondy and U. S. R. Murty ,\" Graph theorey with applications,\" MacMillan, London 1976.\r\n[3] J. C. Bermond, \"Graceful graphs, radio antennae and French windmill,\" Graph Theory and Combinatorics, Pitman, London, 1979, 13-37.\r\n[4] G. S. Bloom, S. W. Golomb, \" Applications of numbered undirected graphs, \" Proceedings of IEEE, 65, 1977,562-570.\r\n[5] G. S. Bloom, S. W. Golomb, \" Numbered complete graphs, unusual rulers, and assorted applications,\" Theorey and Applications of Graphs,Lecture Notes in Mathematics,642,Springer-Verlag, New York, 1978,53-65.\r\n(6) I. Cahit , \" Cordial graphs : a weaker version of graceful and harmonious graphs.\"\r\nArs Combinatoria 23 (1987) , 201-207.\r\n[7] W. C. Chen and H. I. Lu, \" Operations of interlaced tree ,\" preprint.\r\n[8] J. A. Gallian, \" A survey : recent results, conjectures, and open problems in labeling graphs,\"Journal of Graph Theorey, 13(4), 1989,491-504.\r\n[9] T. Grace, \" On sequential labeling of graphs, J . Graph Theorey 7 (1983),195-201.\r\n[10] Frank Harary , \" Graph theory,`\" Addision-Wesley Publishing Company, 1969.\r\n[11] F. Harary, G. W. Wilcox,\" Boolean operations on graphs,\" Math. Scan. 20(1967), 41-51.\r\n[12] Y. S. Ho, S. M. Lee , and S. C. Shee, \" Cordial labelings of the Cartesian product and composition of graphs ,`\" Ars Combinatoria 29 (1990) , 169 -180.\r\n[13] Y. S. Ho , S. M. Lee and S. C. Shee, ., Compositions of graphs, \" preprint.\r\n[14] Y. S. Ho , S. M. Lee and S. C. Shee, \" Cordiallabelings of unicyclic graphs and generalized Petersen graphs, Congressus Numerantium 68( 1989), 109 -122.\r\n[15] Y. S. Ho and S. C. Shee ,\" A characterization of cordial graphs,\"preprint.\r\n[16] Y. S. Ho and S. C. Shee ,\" The cordiality of the cycle union of a graph,\"preprint.\r\n[17] Y. S. Ho and S. C. Shee ,`\" The cordiality of one-point union of n copies of a graph,\"preprint .\r\n[18] H. Y. Lee, H. M. Lee ,and G. J. Chang,\" Cordiallabelings of graphs,\" preprint.\r\n[19] S. M. Lee, K. W. Lih and Y. N. Yen ,`\" On neutral graphs,\" preprint.\r\n[20] S. M. Lee and A. Liu, .\" A construction of cordial graphs from smaller cordial graphs,\"preprint.\r\n[21] W. W. Kirchherr, \" N E P S operations on cordial graphs ,\"preprint.\r\n[22] W. W. Kirchherr, \"On the cordiality of some specific graphs,\" preprint.\r\n[23] G. Ringel, \" Problem 25 ,\" Theorey of Graph and its Applications, Proceedings of the Symposium of Smolenice 1963, Prague Publications House of Czecloslovak Academy of Science, 1964, 162.\r\n[24] A. Rosa, \" On certain valuations of the vertices of a graph. in : Theorey of Graphs, Gordon,Breach-Dunod, N. Y. Paris 1967,349-355.\r\n[25] W. T. Tutte, \"Graph thoery,\" Addision- Wesley Publishing Company ,1984.\r\nencyclopedia of mathematics and its applications volume 21. | zh_TW |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| item.openairetype | thesis | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.cerifentitytype | Publications | - |
| Appears in Collections: | 學位論文 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| index.html | 113 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.