Login / Signup

Some sufficient conditions for a planar graph of maximum degree six to be Class 1.

Yuehua BuWeifan Wang
Published in: Discret. Math. (2006)
Keyphrases
  • sufficient conditions
  • planar graphs
  • linear complementarity problem
  • asymptotic stability
  • linear matrix inequality
  • exponential stability
  • efficiently computable
  • equilibrium point
  • upper bound
  • graphical models