Login / Signup

Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number.

Shuchao LiQin Zhao
Published in: Math. Comput. Model. (2011)
Keyphrases
  • upper bound
  • lower bound
  • small number
  • graph matching
  • high quality
  • pattern matching
  • branch and bound algorithm
  • maximum number
  • data sets
  • graph theoretic