Login / Signup

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles.

Tomás Vetrík
Published in: Discuss. Math. Graph Theory (2008)
Keyphrases
  • upper bound
  • lower bound
  • database
  • real time
  • data sets
  • machine learning
  • clustering algorithm
  • human brain
  • graph mining
  • lower and upper bounds