Login / Signup
A sufficient condition for self-clique graphs.
J. Adrian Bondy
Guillermo Durán
Min Chih Lin
Jayme Luiz Szwarcfiter
Published in:
Electron. Notes Discret. Math. (2001)
Keyphrases
</>
sufficient conditions
independent set
maximum clique
graph properties
asymptotic stability
fixed point
graph theory
lyapunov function
weighted graph
graph mining
linear systems
uniform convergence
quasi cliques
linear complementarity problem
maximum weight
efficiently computable