A sufficient condition for a bipartite graph to be a cube.

Published in: Discret. Math. (2002)

Keyphrases

bipartite graph
sufficient conditions
maximum matching
lyapunov function
linear systems
exponential stability
bipartite graph matching
link prediction
maximum cardinality
asymptotic stability
linear complementarity problem
learning algorithm
maximum weight
special case
equilibrium point
active learning
lower bound