系統識別號 | U0002-2708201802004900 |
---|---|
DOI | 10.6846/TKU.2018.00885 |
論文名稱(中文) | 4-迴圈與3-星圖之圖設計的探討 |
論文名稱(英文) | A study of graph design with 4-cycles and 3-stars |
第三語言論文名稱 | |
校院名稱 | 淡江大學 |
系所名稱(中文) | 數學學系博士班 |
系所名稱(英文) | Department of Mathematics |
外國學位學校名稱 | |
外國學位學院名稱 | |
外國學位研究所名稱 | |
學年度 | 106 |
學期 | 2 |
出版年 | 107 |
研究生(中文) | 李明峯 |
研究生(英文) | Ming-Feng Lee |
學號 | 800190034 |
學位類別 | 博士 |
語言別 | 英文 |
第二語言別 | |
口試日期 | 2018-06-13 |
論文頁數 | 76頁 |
口試委員 |
指導教授
-
高金美
委員 - 傅恆霖 委員 - 黃文中 委員 - 周兆智 委員 - 潘至實 |
關鍵字(中) |
分割 4-迴圈 3-星圖 完全圖 完全 λ重邊圖 |
關鍵字(英) |
decomposition 4-cycle 3-star complete graph complete λ-fold multigraph. |
第三語言關鍵字 | |
學科別分類 | |
中文摘要 |
令K_n是一個具有n個點的完全圖。 令C_k為一個長度為k的迴圈,S_k為一個具有K個邊的圖。 若k = 4,則我們稱C_4為一個4-迴圈,S_3為一個3-星圖。 設 λ 為正整數,λG 代表一個 λ重邊圖其中G中相鄰的任兩點均有 λ 個邊相連。G 的一個分割是指將G分成邊相異的子圖(不需要是相異的圖)。 若 H_1, H_2, …, H_t 是G的子圖,其邊均相異且E(G) = E(H_1)∪E(H_2)∪…∪E(H_t)及Σ_(i=1)^t |E(H_i)|=|E(G)|,則稱G可分割成H_1, H_2, …, H_t。 若對於i = 1, 2, …, t,每個H_i 都與H同構則稱G有一個H-分割。 設p和q為兩個非負的整數,若G 可分割成t個子圖H_1, H_2, …, H_t且其中p個是與H_1同構,剩餘的q個與H_2同構,則稱G可分割成p個H_1和q個H_2。 在這篇論文中,我們將證明假設p和q為兩個非負的整數,對於所有可能的p和q,λK_n均可分割成p個C_4和q個S_3 的充分必要條件為 4p +3q =λ(n choose 2) 及 (1) λ 是偶數,n≧4。 (2) λ = 1,n≧6,當n是奇數時, q≠1, 2;當n是偶數時, q ≧ ceil(n/4) 。 (3) λ 是奇數,λ≧3,n≧5,當n是奇數時, q ≠ 1;當n是偶數時,q ≧ ceil(n/4)。 |
英文摘要 |
Let K_n be the complete graph on n vertices. Let C_k be a cycle of length k and S_k be a star with k edges. If k = 4, then we call C_4 a 4-cycle and S_3 a 3-star. For any positive integer λ, let λG denote the λ-fold multigraph with λ edges between any two adjacent vertices of G. A decomposition of G is a partition of G into edge-disjoint subgraphs (not necessary distinct) of G. If H_1, H_2, …, H_t are edge-disjoint subgraphs of G such that E(G) = E(H_1)∪E(H_2)∪…∪E(H_t) and Σ_(i=1)^t |E(H_i)|=|E(G)| , then we say that H_1, H_2, …, H_t decompose G. Furthermore, G is said to have a H-decomposition if Hi is isomorphic to H for each i = 1, 2, …, t. G can be decomposed into p copies of H_1 and q copies of H_2 for some nonnegative integers p and q if p of H_1, H_2, …, H_t are isomorphic to H1 and the rest q of them are isomorphic to H_2. In this thesis, we prove that for nonnegative integers p and q, there exists a decomposition of λK_n into p copies of C_4 and q copies of S_3 for all possible values of p and q if and only if 4p +3q = λ(n choose 2) and (1) λ is even, n≧4. (2) λ = 1, n≧6, q≠1,2 for odd n and q ≧ ceil(n/4) for even n. (3) λ is odd, λ≧3, n≧5, q≠1 for odd n and q ≧ ceil(n/4) for even n. |
第三語言摘要 | |
論文目次 |
Chapter 1. Introduction..............................................1 1.1 Definitions and Preliminaries........................1 1.2 Known results........................................4 1.3 Main works...........................................6 Chapter 2. Decomposition of K_n .............................8 2.1 Some small cases ....................................9 2.2 Main theorem for odd n..............................13 2.3 Main theorem for even n.............................20 Chapter 3. Decomposition of 2K_n ............................32 3.1 Some small cases....................................32 3.2 Main theorem .......................................37 Chapter 4. Decomposition of λK_n ............................44 4.1 λ = 3 …………………………….....................................44 4.2 λ = 4 …………………............................................49 4.3 λ = 5 ……………………………........................................51 4.4 6≦λ≦13 ……………...……………......................................52 4.5 General cases ......................................56 Reference................................................61 Appendix.................................................64 |
參考文獻 |
[1] A.A. Abueida, M. Daven, Multidecompositions of the complete graph, Ars Combin. 72 (2004) 17–22. [2] A.A. Abueida, T. ONeil, Multidecomposition of λK_m into small cycles and claws, Bull. Inst. Combin. Appl. 49 (2007) 32–40. [3] A.A. Abueida, M. Daven, Multidecompositions of several graph products, Graphs Combin. 29 (2013), no.3, 315–326. http://dx.doi.org/10.1007/s00373-011-1127-x [4] A.A. Abueida, C. Lian, On the decompositions of complete graphs into cycles and stars on the same number of edges, Discuss. Math. Graph Theory 34 (2014), no.1, 113–125. http://dx.doi.org/10.7151/dmgt.1719 [5] F. Beggas, M. Haddad, H. Kheddouci, Decomposition of complete multigraphs into stars and cycles, Discuss. Math. Graph Theory 35(2015), no.4, 616–629. http://dx.doi.org/10.7151/dmgt.1820 [6] J.A. Bondy, U.S.R. Murthy, Graph Theory with Applications, MacMillan, New York, 1976. [7] C.C. Chou, C.M. Fu, Decomposition of Km,n into 4-cycles and 2t-cycles, J. Comb. Optim. 14 (2007), no. 2, 205–218. http://dx.doi.org/10.1007/s10878-007-9060-x [8] C.M. Fu, H.L. Fu, C.A. Rodger, and T. Smith, All graphs with maximum degree three whose complements have 4-cycle decompositions, Discrete Math., 308(2008), 2901-2909. [9] C.M. Fu, Y.-L. Lin, S.-W. Lo, Y.-F. Hsu, Decomposition of complete graphs into triangles and claws, Taiwanese J. Math. 18 (2014), no. 5, 1563–1581. http://dx.doi.org/10.11650/tjm.18.2014.3169 [10] S. Jeevadoss, A. Muthusamy, Decomposition of complete bipartite graphs into paths cycles, Discrete Math. 331 (2014), no. 28, 98–108. http://dx.doi.org/10.1016/j.disc.2014.05.009 [11] S. Jeevadoss, A. Muthusamy, Decomposition of product graphs into paths and cycles of length four, Graphs Combin. 32(2016), no. 1, 199–223. http://dx.doi.org/10.1007/s00373-015-1564-z [12] H.-C. Lee, Multidecompositions of complete bipartite graphs into cycles and stars, Ars Combin. 108 (2013) 355–364. [13] H.-C. Lee, J.-J. Lin, Decomposition of the complete bipartite graph with a 1- factor removed into cycles and stars, Discrete Math. 313 (2013), no. 20, 2354–2358. http://dx.doi.org/10.1016/j.disc.2013.06.014 [14] H.-C. Lee, Decomposition of the complete bipartite multigraph into cycles and stars, Discrete Math. 338 (2015), no. 8, 1362–1369. http://dx.doi.org/10.1016/j.disc.2015.02.019 [15] T.-W. Shyu, Decompositions of complete graphs into paths and cycles, Ars Combin. 97 (2010) 257–270. [16] T.-W. Shyu, Decomposition of complete graphs into paths and stars, Discrete Math. 310 (2010), no.15-16, 2164–2169. http://dx.doi.org/10.1016/j.disc.2010.04.009 [17] T.-W. Shyu, Decomposition of complete graphs into paths of length three and triangles, Ars Combin. 107 (2012) 209–224. [18] T.-W. Shyu, Decomposition of complete graphs into cycles and stars, Graphs Combin. 29 (2013), no. 2, 301–313. http://dx.doi.org/10.1007/s00373-011-1105-3 [19] T.-W. Shyu, Decomposition of complete bipartite graphs into paths and stars with same number of edges, Discrete Math. 313 (2013), no. 7, 865–871. http://dx.doi.org/10.1016/j.disc.2012.12.020 [20] D. Sotteau, Decomposition of K_(m,n)(K_(m,n)^*) into cycles (circuits) of length 2k, J. Comb. Theory Ser. B, 30(1981), 75-81. [21] M. Tarsi, Decomposition of complete multigraph into stars, Discrete Math., 26(1979), 273-278. [22] S. Yamamoto, H. Ikeda, S. Shige-ede, K. Ushio and N. Hamada, On claw decomposition of complete graphs and complete bipartite graphs, Hiroshima Math. J.,5(1975),33-42. |
論文全文使用權限 |
如有問題,歡迎洽詢!
圖書館數位資訊組 (02)2621-5656 轉 2487 或 來信