1-Vertex-Hamiltonian-Laceability of Hypercubes with Maximal Edge Faults
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 92 === Suppose that G = (V_0 union V_1,E) is a bipartite graph with two partite sets V_0 and V_1 of equal size. Let x and y be two arbitrary distinct vertices and let w be another vertex different from x and y. G is said to be 1-vertex-Hamiltonian-laceable if G-w sat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47276269802483134455 |