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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/323546 |