Hamiltonian Connectivity,Pancyclicity and Globally-3*-connectedness of some interconnection networks
碩士 === 中原大學 === 應用數學研究所 === 94 === Let G0 = (V0, E0) and G1 = (V1, E1) be two graphs such that |V0| = |V1| = t. Let M be an arbitrary perfect matching between G0 and G1. More specifically, M is a set of t edges with one endpoint in G0 and the other in G1. Define G = G(G0, G1; M) such that V(G) = V0...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31796743598806110543 |