Almost Moore and the largest mixed graphs of diameters two and three

DOI10.1016/J.LAA.2024.01.007MaRDI QIDQ6401289FDO

Authors C. Dalfó, Miquel Angel Fiol, Nacho López

Publication date 6 June 2022

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)

Abstract: Almost Moore mixed graphs/} appear in the context of the degree/diameter problem as a class of extremal mixed graphs, in the sense that their order is one unit less than the Moore bound for such graphs. The problem of their existence has been considered just for diameter $2$. In this paper, we give a complete characterization of these extremal mixed graphs for diameters 2 and 3. We also derive some optimal constructions for other diameters.

Recommendations

• On mixed almost Moore graphs of diameter two
• Construction of extremal mixed graphs of diameter two
• On mixed Moore graphs
• A revised Moore bound for mixed graphs
• On mixed radial Moore graphs of diameter 3

This page was built for publication: Almost Moore and the largest mixed graphs of diameters two and three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401289)