Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2605.26201 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913162372055040 |
|---|---|
| author | Abiad, A. Ceresuela, Jesús M. López, N. |
| author_facet | Abiad, A. Ceresuela, Jesús M. López, N. |
| contents | Mixed radial Moore graphs are approximations of mixed Moore graphs that preserve the distance-preserving spanning tree for some vertices. One way to measure their resemblance to a mixed Moore graph is using the status measure. The status of a graph is defined as the sum of the distances between all pairs of ordered vertices. Mixed radial Moore graphs with minimum status are closer to mixed Moore graphs according to this measure. The existence of mixed radial Moore graphs is still unknown for most values of the degree and the diameter. In this work, we develop an integer programming model (IP) to find mixed radial Moore graphs of diameter 3 with minimum status. As a result, we show the existence of these graphs for several new values of the degree and the diameter. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_26201 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A note on integer programming methods for mixed radial Moore graphs Abiad, A. Ceresuela, Jesús M. López, N. Combinatorics Mixed radial Moore graphs are approximations of mixed Moore graphs that preserve the distance-preserving spanning tree for some vertices. One way to measure their resemblance to a mixed Moore graph is using the status measure. The status of a graph is defined as the sum of the distances between all pairs of ordered vertices. Mixed radial Moore graphs with minimum status are closer to mixed Moore graphs according to this measure. The existence of mixed radial Moore graphs is still unknown for most values of the degree and the diameter. In this work, we develop an integer programming model (IP) to find mixed radial Moore graphs of diameter 3 with minimum status. As a result, we show the existence of these graphs for several new values of the degree and the diameter. |
| title | A note on integer programming methods for mixed radial Moore graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.26201 |