A sufficient condition for equality of edge-connectivity and minimum degree of a graph.
Donald L. GoldsmithRoger C. EntringerPublished in: J. Graph Theory (1979)
Keyphrases
- sufficient conditions
- weighted graph
- strongly connected
- undirected graph
- connected components
- spanning tree
- graph connectivity
- exponential stability
- graph structure
- directed graph
- edge weights
- asymptotic stability
- lyapunov function
- fixed point
- linear systems
- minimum cost
- equilibrium point
- linear complementarity problem
- multi class
- fuzzy logic
- semidefinite
- efficiently computable
- genetic algorithm