The Study of Vertices Fault-Tolerance for Edge-Bipancyclicity of Hypercube
碩士 === 大葉大學 === 資訊工程學系碩士班 === 98 === A bipartite graph G = (V,E) edgebipancyclic if every edge lies on the cycles of every even length from 4 to |V |. Let Qn = (Vb U Vw,E) be an n-dimensional hypercube where Vb and Vw are the sets of black and white vertices, respectively. Let Fb (resp. Fw) be the s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28326910710211763514 |