Bounds in radial Moore graphs of diameter 3
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910720497549312 |
|---|---|
| author | Ceresuela, Jesús M. López, Nacho |
| author_facet | Ceresuela, Jesús M. López, Nacho |
| contents | Radial Moore graphs are approximations of Moore graphs that preserve the distance-preserving spanning tree for its central vertices. One way to classify their resemblance with a Moore graph is the status measure. The status of a graph is defined as the sum of the distances of all pairs of ordered vertices and equals twice the Wiener index. In this paper we study upper bounds for both the maximum number of central vertices and the status of radial Moore graphs. Finally, we present a family of radial Moore graphs of diameter $3$ that is conjectured to have maximum status. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19587 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bounds in radial Moore graphs of diameter 3 Ceresuela, Jesús M. López, Nacho Combinatorics Radial Moore graphs are approximations of Moore graphs that preserve the distance-preserving spanning tree for its central vertices. One way to classify their resemblance with a Moore graph is the status measure. The status of a graph is defined as the sum of the distances of all pairs of ordered vertices and equals twice the Wiener index. In this paper we study upper bounds for both the maximum number of central vertices and the status of radial Moore graphs. Finally, we present a family of radial Moore graphs of diameter $3$ that is conjectured to have maximum status. |
| title | Bounds in radial Moore graphs of diameter 3 |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.19587 |