Elementary proofs of the diameter bounds for the power graphs
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_ | 1866915009800437760 |
|---|---|
| author | Barbieri, Marco Rekvényi, Kamilla |
| author_facet | Barbieri, Marco Rekvényi, Kamilla |
| contents | We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected of diameter at most $3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_05429 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Elementary proofs of the diameter bounds for the power graphs Barbieri, Marco Rekvényi, Kamilla Group Theory Combinatorics 20D60, 05C25 We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected of diameter at most $3$. |
| title | Elementary proofs of the diameter bounds for the power graphs |
| topic | Group Theory Combinatorics 20D60, 05C25 |
| url | https://arxiv.org/abs/2411.05429 |