圖形的訊息傳遞問題

Abstract

給定一個圖形G，以及集合M，M為一描述圖形G中各點擁有訊息之情形的集合。圖形G相對於M的的傳遞數是指，於最短時間內，讓圖形中全部點皆獲得所有種類之訊息，並將符號記為t(G;M) 。傳遞過程中每個時間單位將受到下列限制:\n(1)圖形上的每個點只能與自己相鄰的點交換訊息。\n(2)兩個相鄰的點在每個單位時間裡至多只能交換一個訊息。\n我們希望可以找到在最短的時間裡完成傳遞的方法，也就是讓圖形G中的每一個點都獲得所有種類之訊息，我們稱此類型問題為訊息傳遞問題。\n在本論文中，給定一個圖形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.