A Hamilton sufficient condition for completely independent spanning tree.
Xia HongHuihui ZhangPublished in: Discret. Appl. Math. (2020)
Keyphrases
- sufficient conditions
- spanning tree
- completely independent
- minimum spanning tree
- minimum spanning trees
- minimum cost
- undirected graph
- minimum weight
- linear systems
- asymptotic stability
- finite state
- exponential stability
- minimum total cost
- neural network
- lyapunov function
- weighted graph
- optimal policy
- linear complementarity problem
- efficiently computable
- linear programming