Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.13784 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910622287921152 |
|---|---|
| author | Ebrahimi, Mahdi |
| author_facet | Ebrahimi, Mahdi |
| contents | For a simple graph $G$, the complement and the line graph of $G$ are denoted by $G^c$ and $L(G)$, respectively. In this paper, we show that for every simple connected regular graph $G$ with at least $5$ vertices, the graph $\mathcal{R}(G):=L(L(G)^c)^c$ is a Ramanujan graph with diameter at most three. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_13784 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Ramanujan graphs with diameter at most three Ebrahimi, Mahdi Combinatorics 05C50 For a simple graph $G$, the complement and the line graph of $G$ are denoted by $G^c$ and $L(G)$, respectively. In this paper, we show that for every simple connected regular graph $G$ with at least $5$ vertices, the graph $\mathcal{R}(G):=L(L(G)^c)^c$ is a Ramanujan graph with diameter at most three. |
| title | Ramanujan graphs with diameter at most three |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2409.13784 |