Login / Signup

On the largest matching roots of graphs with a given number of pendent vertices.

Hailiang ZhangGuangting ChenGuanglong Yu
Published in: Discret. Appl. Math. (2019)
Keyphrases
  • undirected graph
  • small number
  • graph matching
  • edge weights
  • random graphs
  • lower bound
  • memory requirements
  • weighted graph