The recognition of geodetically connected graphs
Information Processing Letters
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Minimum 3-geodetically connected graphs
Discrete Applied Mathematics
On Understanding of Transient Interdomain Routing Failures
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
| Hi-index | 0.04 |
A connected graph G is k-geodetically connected (k-GC) if the removal of less than k vertices does not affect the distances (lengths of the shortest paths) between any pair of the remaining vertices. As such graphs have important applications in robust system designs, we are interested in the minimum number of edges required to make a k-GC graph of order n, and characterizing those minimum k-GC graphs. When 3