跳到主要內容

臺灣博碩士論文加值系統

(34.204.198.73) 您好!臺灣時間:2024/07/16 17:41
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:葉怡君
論文名稱:具漢米爾頓環路或漢米爾頓路徑的圖形的廣義傳播值
論文名稱(外文):Generalized broadcasting numbers for graphs with Hamiltonian cycles or
指導教授:郭大衛郭大衛引用關係陳天進陳天進引用關係
學位類別:碩士
校院名稱:國立政治大學
系所名稱:應用數學研究所
學門:數學及統計學門
學類:數學學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:20
中文關鍵詞:傳播值漢米爾頓漢米爾頓迴路漢米爾頓路徑
相關次數:
  • 被引用被引用:0
  • 點閱點閱:239
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在本論文中,我們給定具漢米爾頓環路或漢米爾頓路徑的圖形的k-傳播值下界,且找到它確定的值,並說明具漢米爾頓環路的k-傳播值及漢米爾頓路徑的圖形的全傳播值。
1.中文摘要………………………………………………….Ⅰ
2.英文摘要………………………………………………….Ⅱ
3.Introduction………………………………………………1
4.Preliminary…………………………………………………4
5.Total broadcasting time for graphs with Hamiltonian cycles or Hamiltonian paths………………………………………7
6.Conclusion………………………………………………………17
7.References…………………………………………………………17
(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.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top