Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Gomez, J.; Miller, M.
Tipus d'activitat
Article en revista
Revista
European journal of combinatorics
Data de publicació
2015-07-01
Volum
47
Pàgina inicial
15
Pàgina final
22
DOI
https://doi.org/10.1016/j.ejc.2015.01.004 Obrir en finestra nova
Projecte finançador
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Resum
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...
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

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