Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/32595


Title: 具漢米爾頓環路或漢米爾頓路徑的圖形的廣義傳播值
Generalized broadcasting numbers for graphs with Hamiltonian cycles or
Authors: 葉怡君
Contributors: 郭大衛
陳天進

葉怡君
Keywords: 傳播值
漢米爾頓
漢米爾頓迴路
漢米爾頓路徑
Date: 2007
Issue Date: 2009-09-17 13:48:58 (UTC+8)
Abstract: 在本論文中,我們給定具漢米爾頓環路或漢米爾頓路徑的圖形的k-傳播值下界,且找到它確定的值,並說明具漢米爾頓環路的k-傳播值及漢米爾頓路徑的圖形的全傳播值。
Reference: (1)Wei-Zen Chen, Generalized Broadcasting Problems of Graphs, Master Thesis, Dept. Applied Math., National Dong Hwa Univ., 2004.
(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.
(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.
(4)A. Farley, "Broadcast time in communication networks". SIAM J. Appl. Math. 39 (1980) 385-390.
(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.
(6)A. Farley and A. Proskurowski, "Broadcasting in trees with multiple originators." SIAM J. Alg. Disc. Methods. 2 (1981) 381-386.
(7)M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
(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.
(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.
(10)P. J. Slater, E. Cockayne and S. T. Hedetniemi, "Information dissemination in trees." SIAM J. Comput. 10 (1981) 692-701.
K. W. Tien, Broadcasting Problem in Communication Networks, (11)Master Thesis, Dept. Applied Math., National Chiao Tung Univ., 2000.
(12)Y. S. Tsay, Gossiping and Broadcasting in Communication Networks, Ph.D. Thesis, Dept. Applied Math., National Chiao Tung Univ., 1996.
(13)M. L. Chia, D. Kuo and M. F. Tung, The multiple originator broadcasting problem in graphs, Disc. Appl. Math. 155 (2007) 1188-1199.
Description: 碩士
國立政治大學
應用數學研究所
94972009
96
Source URI: http://thesis.lib.nccu.edu.tw/record/#G0094972009
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File Description SizeFormat
200901.pdf63KbAdobe PDF724View/Open
200902.pdf67KbAdobe PDF803View/Open
200903.pdf92KbAdobe PDF758View/Open
200904.pdf32KbAdobe PDF692View/Open
200905.pdf185KbAdobe PDF802View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing