dc.contributor.advisor | 郭大衛<br>陳天進 | zh_TW |
dc.contributor.author (作者) | 葉怡君 | zh_TW |
dc.creator (作者) | 葉怡君 | zh_TW |
dc.date (日期) | 2007 | en_US |
dc.date.accessioned | 17-九月-2009 13:48:58 (UTC+8) | - |
dc.date.available | 17-九月-2009 13:48:58 (UTC+8) | - |
dc.date.issued (上傳時間) | 17-九月-2009 13:48:58 (UTC+8) | - |
dc.identifier (其他 識別碼) | G0094972009 | en_US |
dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/32595 | - |
dc.description (描述) | 碩士 | zh_TW |
dc.description (描述) | 國立政治大學 | zh_TW |
dc.description (描述) | 應用數學研究所 | zh_TW |
dc.description (描述) | 94972009 | zh_TW |
dc.description (描述) | 96 | zh_TW |
dc.description.abstract (摘要) | 在本論文中,我們給定具漢米爾頓環路或漢米爾頓路徑的圖形的k-傳播值下界,且找到它確定的值,並說明具漢米爾頓環路的k-傳播值及漢米爾頓路徑的圖形的全傳播值。 | zh_TW |
dc.description.tableofcontents | 1.中文摘要………………………………………………….Ⅰ2.英文摘要………………………………………………….Ⅱ3.Introduction………………………………………………14.Preliminary…………………………………………………45.Total broadcasting time for graphs with Hamiltonian cycles or Hamiltonian paths………………………………………76.Conclusion………………………………………………………177.References…………………………………………………………17 | zh_TW |
dc.format.extent | 64804 bytes | - |
dc.format.extent | 69490 bytes | - |
dc.format.extent | 95214 bytes | - |
dc.format.extent | 32859 bytes | - |
dc.format.extent | 190143 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en_US | - |
dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0094972009 | en_US |
dc.subject (關鍵詞) | 傳播值 | zh_TW |
dc.subject (關鍵詞) | 漢米爾頓 | zh_TW |
dc.subject (關鍵詞) | 漢米爾頓迴路 | zh_TW |
dc.subject (關鍵詞) | 漢米爾頓路徑 | zh_TW |
dc.title (題名) | 具漢米爾頓環路或漢米爾頓路徑的圖形的廣義傳播值 | zh_TW |
dc.title (題名) | Generalized broadcasting numbers for graphs with Hamiltonian cycles or | en_US |
dc.type (資料類型) | thesis | en |
dc.relation.reference (參考文獻) | (1)Wei-Zen Chen, Generalized Broadcasting Problems of Graphs, Master Thesis, Dept. Applied Math., National Dong Hwa Univ., 2004. | zh_TW |
dc.relation.reference (參考文獻) | (2)P. Chinn, S. Hedetniemi and S. Mitchell, "Multiple-message broadcasting in complete graphs". In Proc.Tenth SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1979, pp. 251-260. | zh_TW |
dc.relation.reference (參考文獻) | (3)E. J. Cockayne and A. Thomason, "Optimal multi-message broadcasting in complete graphs". In Proc. Eleventh SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1980, pp. 181-199. | zh_TW |
dc.relation.reference (參考文獻) | (4)A. Farley, "Broadcast time in communication networks". SIAM J. Appl. Math. 39 (1980) 385-390. | zh_TW |
dc.relation.reference (參考文獻) | (5)A. Farley and S. Hedetniemi, "Broadcasting in grid graphs." In Proc. Ninth SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1987. | zh_TW |
dc.relation.reference (參考文獻) | (6)A. Farley and A. Proskurowski, "Broadcasting in trees with multiple originators." SIAM J. Alg. Disc. Methods. 2 (1981) 381-386. | zh_TW |
dc.relation.reference (參考文獻) | (7)M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979. | zh_TW |
dc.relation.reference (參考文獻) | (8)S. M. Hedetniemi and S. T. Hedetniemi, "Broadcasting by decomposing trees into paths of bounded length". Technical Report CS-TR-79-16, University of Oregon, 1979. | zh_TW |
dc.relation.reference (參考文獻) | (9)S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman, "A Survey of gossiping and broadcasting in communication networks", Networks 18 (1988), 319-349. | zh_TW |
dc.relation.reference (參考文獻) | (10)P. J. Slater, E. Cockayne and S. T. Hedetniemi, "Information dissemination in trees." SIAM J. Comput. 10 (1981) 692-701. | zh_TW |
dc.relation.reference (參考文獻) | K. W. Tien, Broadcasting Problem in Communication Networks, (11)Master Thesis, Dept. Applied Math., National Chiao Tung Univ., 2000. | zh_TW |
dc.relation.reference (參考文獻) | (12)Y. S. Tsay, Gossiping and Broadcasting in Communication Networks, Ph.D. Thesis, Dept. Applied Math., National Chiao Tung Univ., 1996. | zh_TW |
dc.relation.reference (參考文獻) | (13)M. L. Chia, D. Kuo and M. F. Tung, The multiple originator broadcasting problem in graphs, Disc. Appl. Math. 155 (2007) 1188-1199. | zh_TW |