Nonisomorphic 2-factors in Balanced Complete Bipartite Graphs
碩士 === 國立交通大學 === 應用數學系所 === 106 === Let G=(V,E) be a simple graph. A k-factor of G is a spanning subgraph of G such that each vertex is of degree k. Two graphs G_1 and G_2 are isomorphic if there exists a bijection f:V(G_1) \rightarrow V(G_2) such that {u, v} is an edge of G_1 if and only if {f(u),...
Main Authors: | Tai, Juo-Yun, 戴若昀 |
---|---|
Other Authors: | Fu, Hung-Lin |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/323546 |
Similar Items
-
Two families of graphs that are Cayley on nonisomorphic groups
by: Josip Smolci̇c, et al.
Published: (2021-05-01) -
Multipackings and multicoverings of the balanced complete bipartite graph
by: Yen-Po Chu, et al.
Published: (2013) -
Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
by: G. Sethuraman, et al.
Published: (2020-07-01) -
2-Competition Graphs in Complete Bipartite Graphs
by: Hui-Ming Shieh, et al.
Published: (1995) -
P_t-factorization of Complete bipartite graphs
by: Kun-Nan Chen, et al.
Published: (2008)