A Study on the Connectivity and Super Connectivity of Locally Exchanged Twisted Cubes
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 103 === Connectivity k(G) (respectively, super connectivity k'(G)) of a graph G is the minimum number of vertices whose removal leaves the remaining graph disconnected or trivial (respectively, the remaining graph disconnected and without isolated vertex). The...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36971863446508253477 |