Hyper-Panconnectedness of the Locally Twisted Cubes
碩士 === 靜宜大學 === 資訊工程學系 === 99 === A graph G is said to be panconnected (Alavi, 1975) if for any two distinct nodes x and y, it has a path of length l joining x and y for any integer l satisfying dG(x,y) ≦l ≦ |V(G)|－1 , where dG(x; y) denotes the distance between nodes x and y in G, and |V(G)| is the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52369992684835948458 |