On the (k,h)-Geodetically Connected Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 92 === A connected graph G is k-geodetically connected (k-GC) if the removal of at least k vertices is required to increase the distance between at least one pair of vertices. There are lots of researches about k-GC graphs used to design invulnerable networks, and the m...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36391473083456994909 |