Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === A k-regular Hamiltonian and Hamiltonian connected graph is called super fault-tolerant Hamiltonian if and only if it remains Hamiltonian after removing at most k - 2 nodes and/or edges and remains Hamiltonian connected after removing at most k - 3 nodes and/...
Main Authors: | Jiun-Ji Chen, 陳俊吉 |
---|---|
Other Authors: | Sun-Yuan Hsieh |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/40949329547161452637 |
Similar Items
-
Conditional Edge-Fault Hamiltonicity of Cartesian Product Graph
by: Chia-Wen Cheng, et al.
Published: (2009) -
Super Connectivity, Fault-Tolerant Hamiltonicity, and Bipancyclicity for Some Interconnection Networks
by: Y-Chuang Chen, et al.
Published: (2003) -
Hamilton-connected properties in cartesian product
by: Rushengul Hoshur, et al.
Published: (2012-09-01) -
Fault-Tolerant Hamiltonicity Of Cube-Connected Cycles Graphs
by: Wei, Zhiming, et al.
Published: (2012) -
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
by: Zhang Guozhen, et al.
Published: (2019-02-01)