On new record graphs close to bipartite Moore graphs
From MaRDI portal
Publication:2152609
Abstract: The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while holding the other two fixed. Here we focus in {em bipartite Moore graphs/}, that is, bipartite graphs attaining the optimum order, fixed either the degree/diameter or degree/girth. The fact that there are very few bipartite Moore graphs suggests the relaxation of some of the constraints implied by the bipartite Moore bound. First we deal with {em local bipartite Moore graphs}. We find in some cases those local bipartite Moore graphs with local girths as close as possible to the local girths given by a bipartite Moore graph. Second, we construct a family of -bipartite graphs of order and diameter , for a power of prime. These graphs attain the record value for and improve the values for and .
Recommendations
- On Moore bipartite digraphs
- scientific article; zbMATH DE number 5309966
- scientific article; zbMATH DE number 1735799
- Bipartite biregular Moore graphs
- A spectral version of the Moore problem for bipartite regular graphs
- A Spectral Moore Bound for Bipartite Semiregular Graphs
- On the structure of digraphs with order close to the Moore bound
- scientific article; zbMATH DE number 3857150
- A revised Moore bound for mixed graphs
- scientific article; zbMATH DE number 1792622
Cites work
- Abstract algebra. An introductory course
- Dynamic cage survey
- Families of small regular graphs of girth 5
- Geometric realisation of the graphs of McKay-Miller-Širáň
- HSAGA and its application for the construction of near-Moore digraphs
- Large Graphs with Given Degree and Diameter III
- Large Graphs with Given Degree and Diameter—Part I
- Mixed cages: monotonicity, connectivity and upper bounds
- Moore graphs and beyond: a survey of the degree/diameter problem
- New small regular graphs of girth 5
- On bipartite‐mixed graphs
- On large bipartite graphs of diameter 3
- On the existence of radial Moore graphs for every radius and every degree
- Radial Moore graphs of radius three
- Ranking measures for radially Moore graphs
Cited in
(4)
This page was built for publication: On new record graphs close to bipartite Moore graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152609)