Loading...
Loading...

Go to the content (press return)

On the existence of radial moore graphs for every radius and every degree

Author
Gomez, J.; Miller, M.
Type of activity
Journal article
Journal
European journal of combinatorics
Date of publication
2015-07-01
Volume
47
First page
15
Last page
22
DOI
https://doi.org/10.1016/j.ejc.2015.01.004 Open in new window
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Abstract
The degree/diameter problem is to determine the largest graphs of given maximum degree and given diameter. General upper bounds - called Moore bounds - for the order of such graphs are attainable only for certain special graphs, called Moore graphs. Moore graphs are scarce and so the next challenge is to find graphs which are somehow "close" to the nonexistent ideal of a Moore graph by holding fixed two of the parameters, order, diameter and maximum degree, and optimising the third parameter. In...
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

  • Gomez Marti, Jose  (author)
  • Miller, Mirka  (author)