Radial Moore graphs of radius three

Authors:
Geoffrey Exoo;Joan Gimbert;Nacho López;José Gómez
Affiliations:
Department of Mathematics and Computer Science, Indiana State University, Terre Haute, IN 47809, USA;Departament de Matemítica, Universitat de Lleida, Jaume II 69, 25001 Lleida, Spain;Departament de Matemítica, Universitat de Lleida, Jaume II 69, 25001 Lleida, Spain;Departament de Matemítica Aplicada IV, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 5
Cited 0

Connectivity of Regular Directed Graphs with Small Diameters

IEEE Transactions on Computers
Design to Minimize Diameter on Building-Block Network

IEEE Transactions on Computers
HSAGA and its application for the construction of near-Moore digraphs

Journal of Discrete Algorithms
On Moore graphs with diameters 2 and 3

IBM Journal of Research and Development
Ranking measures for radially Moore graphs

Networks

Quantified Score

Hi-index	0.04

Visualization

Abstract

The maximum number of vertices in a graph of specified degree and diameter cannot exceed the Moore bound. Graphs achieving this bound are called Moore graphs. Because Moore graphs are so rare, researchers have considered various relaxations of the Moore graph constraints. Since the diameter of a Moore graph is equal to its radius, one can consider graphs in which the condition on the diameter is relaxed, by one, while the condition on the radius is maintained. Such graphs are called radial Moore graphs. It has previously been shown that radial Moore graphs exist for all degrees when the radius is two. In this paper, we extend this result to radius three. We also construct examples that settle the existence question for a few new cases, and summarize the state of knowledge on the problem.