The study of decompositions of K2m,2ninto 4-cycles, 6-cycles, 8-cycles, or 10-cycles
| Autor: | Yuan-Lung Lin, 林遠隆 |
|---|---|
| Rok vydání: | 2005 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 93 A graph is called a bipartite graph if the vertex set of the graph can be partitioned into two disjoint nonempty sets, and any two vertices in the same set are not adjacency. Moreover, if any two vertices in the different set are adjacency, then this bipartite graph is called a complete bipartite graph, and denoted by Km,n. A complete bipartite graph Km,n can be decomposed into some subgraphs if Km,n can be partitioned into edge-disjoint subgraphs, such that the union of vertex sets of these subgraphs is the vertex set of Km,n, and the union of edge sets is the edge set of Km,n. In this thesis, we show that when 22 and non-negative integets p, q, r, s, if 4p+6q+8r+10s = 4mn, then K2m,2n can be decomposed into p 4-cycle, q 6-cycle, r 8-cycle, or s 10-cycle. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|