A sufficient condition for spanning trees with bounded maximum degree in a graph.
Aung KyawPublished in: Australas. J Comb. (2007)
Keyphrases
- sufficient conditions
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- undirected graph
- linear complementarity problem
- minimum spanning trees
- exponential stability
- edge weights
- weighted graph
- asymptotic stability
- root node
- linear systems
- uniform convergence
- lyapunov function
- total length
- efficiently computable
- np hard
- graph theory
- equilibrium point
- knn