A Study of the Mutually Independent Hamiltonicity and the Spanning Connectivity of Some Interconnection Networks
博士 === 國立交通大學 === 資訊科學與工程研究所 === 99 === The Menger Theorem (Menger, 1972) show that there are k-disjoint paths between any two distinct vertices of G if and only if G is k-connected. A graph G is k*-connected if there exists a k-disjoint paths between any two distinct vertices which contains all the...
Main Authors: | Lin, Cheng-Kuan, 林政寬 |
---|---|
Other Authors: | Tan, Jimmy J. M. |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81137779622233546680 |
Similar Items
-
Independent Spanning Trees on Some Interconnection Networks
by: Jinn-shyong Yang, et al.
Published: (2007) -
Super Connectivity, Fault-Tolerant Hamiltonicity, and Bipancyclicity for Some Interconnection Networks
by: Y-Chuang Chen, et al.
Published: (2003) -
Mutually Independent Hamiltonian Cycles on Some Graphs in Interconnection Networks
by: Hsun Su, et al.
Published: (2011) -
On the mutually independent property and bipanconnected property of some interconnection networks
by: Shih, Yuan-Kang, et al.
Published: (2012) -
Mutually Independent Hamiltonian Cycles on Arrangement Graphs
by: Cheng-Da Lin, et al.
Published: (2011)