頁籤選單縮合
題 名 | The Tree Number of Cyclic Regular Multipartite Graphs=迴圈正則多部圖之樹形數 |
---|---|
作 者 | 林正忠; 周敏貞; | 書刊名 | 嶺東學報 |
卷 期 | 19 民95.06 |
頁 次 | 頁1-8 |
分類號 | 319.76 |
關鍵詞 | 迴圈正則多部圖; 樹形; 樹形數; Cyclic regular multipartite graph; Tree; Tree number; |
語 文 | 英文(English) |
中文摘要 | 設G為一圖形。將圖形G(不考慮迴圈及多重邊的情形)以最小數目的樹形組合而成,則稱此數為G的樹形數,記為t(G)。對於m≥3,定義迴圈正則多部圖C(m×n)為一個具有點集V(C(m×n)) = {vi,j : 1 ≤ i ≤ m, 1 ≤ j ≤ n}及邊集E(C(m×n)) = {vi,j vi',j' : i' ≡ i + 1 (mod m) and 1 ≤ j, j' ≤ n}的圖形。在這篇文章中,我們找出了迴圈正則多部圖的樹形數t(C(m×n))。 |
英文摘要 | Suppose G is a graph. The tree number t(G) of a graph G is defined as the minimum number of disjoint trees whose union is G (we exclude graphs with loops and multiple edges). For m≥3, let the cyclic regular multipartite graph C(m×n) be the graph with V(C(m×n)) = {vi,j : 1 ≤ i ≤ m, 1 ≤ j ≤ n} and E(C(m×n)) = {vi,j vi',j' : i' ≡ i + 1 (mod m) and 1 ≤ j, j' ≤ n}. In this article, we will find the tree number of cyclic regular multipartite graphs t(C(m×n)). |
本系統中英文摘要資訊取自各篇刊載內容。