簡易檢索 / 詳目顯示
| 研究生： |
余銘芬 Yu, Ming Fen |
|---|---|
| 論文名稱： |
圖形的訊息傳遞問題 Message transmission problems of graphs |
| 指導教授： |
郭大衛
李陽明 |
| 學位類別： |
碩士
Master |
| 系所名稱： |
理學院 - 應用數學系數學教學碩士在職專班 |
| 論文出版年： | 2011 |
| 畢業學年度： | 99 |
| 語文別： | 英文 |
| 論文頁數： | 17 |
| 中文關鍵詞： | 傳遞數 、傳遞集 、樹圖 、完全二部圖 、雙環網路 |
| 外文關鍵詞： | transmission number, transmitting set, tree, complete bipartite graph, double loop network. |
| 相關次數： | 點閱：129 下載：42 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
給定一個圖形G，以及集合M，M為一描述圖形G中各點擁有訊息之情形的集合。圖形G相對於M的的傳遞數是指，於最短時間內，讓圖形中全部點皆獲得所有種類之訊息，並將符號記為t(G;M) 。傳遞過程中每個時間單位將受到下列限制:
(1)圖形上的每個點只能與自己相鄰的點交換訊息。
(2)兩個相鄰的點在每個單位時間裡至多只能交換一個訊息。
我們希望可以找到在最短的時間裡完成傳遞的方法，也就是讓圖形G中的每一個點都獲得所有種類之訊息，我們稱此類型問題為訊息傳遞問題。
在本論文中，給定一個圖形G，且圖形G中每個點的訊息只有一個，G中任兩點的訊息都不會相同，符號t(G)代表完成傳遞所需最少的時間單位。我們給定圖形的傳遞數的上界與下界，並且定出一套公式計算樹圖、完全二部圖及雙環網路圖的傳遞數。
Given a graph G together with a set M , the transmission number of G corresponding to M , denoted by t(G;M), is the minimum number of time needed to complete the transmission , that is, to let all the vertices in G know all the messages in M , subject to the constraints that at each time unit, each vertex can interchange messages with all its neighbors, but the number of messages that two vertices can interchange at each time unit is at most one. We want to find the minimum number of time units required to complete the transmission, that is, to let all the vertices in G know all the messages. We call such a problem the message transmission problem. Given a graph G, the transmission number of G, denoted t(G), is the minimum number of time units required to complete the transmission, under the condition that |m(v)|=1 for all v in V(G). In this thesis, we give upper and lower bounds for the transmission number of G, and give formulas to compute the transmission numbers of trees, complete bipartite graphs and double loop networks.
謝辭...................II
中文摘要................III
英文摘要................IV
1.Introduction.........1
2.Preliminary..........3
3.Trees................6
4.Complete bipartite graphs....12
5.Double loop networks.........13
6.References...................16
[1] C. W. Chang, D. Kuo and C. H. Li, Generalized broadcasting and gossiping problem of graphs. preprint.
[2] M. L. Chia, D. Kuo and M. F. Tung, The multiple originator broadcasting problem in graphs, Disc. Appl. Math. 155 (2007) 1188-1199.
[3] 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 Mathe-matica, Winnipeg, 1979, pp. 251-260.
[4] 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.
[5] A. Farley, Broadcast time in communication networks. SIAM J. Appl. Math. 39 (1980) 385-390.
[6] A. Farley and S. Hedetniemi, Broadcasting in grid graphs. In Proc. Ninth SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1987.
[7] A. Farley and A. Proskurowski, Broadcasting in trees with multiple originators. SIAM J. Alg. Disc. Methods. 2 (1981)381-386.
[8] M. Garey and D. Johnson, Computers and Intractability: A
Guide to the Theory of NP-Completeness. Freeman, San Fran-
cisco, 1979.
[9] S. M. Hedetniemi and S. T. Hedetniemi, Broadcasting by de-composing trees into paths of bounded length. Technical Re-port CS-TR-79-16, University of Oregon, 1979.
[10] S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman, A Survey of gossiping and broadcasting in communication net-
works, Networks 18 (1988), 319-349.
[11] P. J. Slater, E. Cockayne and S. T. Hedetniemi, Information dissemination in trees.SIAM J. Comput. 10 (1981) 692-701.
