Kissing numbers of regular graphs

27 Sep 2019 Bourque Maxime Fortier Petri Bram

We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds only for Moore graphs, which gives a new characterization of these graphs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • METRIC GEOMETRY