Almost Moore and the largest mixed graphs of diameters two and three
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 co...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2024 |
| Country: | España |
| Institution: | Universitat de Lleida (UdL) |
| Repository: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/465749 |
| Online Access: | https://doi.org/10.1016/j.laa.2024.01.007 https://hdl.handle.net/10459.1/465749 |
| Access Level: | Open access |
| Keyword: | Mixed graph Degree/diameter problem Almost Moore graph Distance matrix Spectrum |
| Summary: | 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. |
|---|