Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.02457 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917801710583808 |
|---|---|
| author | Benson, Deepu Das, Bireswar Dey, Dipan Ghosh, Jinia |
| author_facet | Benson, Deepu Das, Bireswar Dey, Dipan Ghosh, Jinia |
| contents | In this paper, we study the oriented diameter of power graphs of groups. We show that a $2$-edge connected power graph of a finite group has oriented diameter at most $4$. We prove that the power graph of the cyclic group of order $n$ has oriented diameter $2$ for all $n\neq 1,2,4,6$. For non-cyclic finite nilpotent groups, we show that the oriented diameter of corresponding power graphs is at least $3$. Moreover, we provide necessary and sufficient conditions for the oriented diameter of $2$-edge connected power graphs of finite non-cyclic nilpotent groups to be either $3$ or $4$. This, in turn, gives an algorithm for computing the oriented diameter of the power graph of a given nilpotent group that runs in time polynomial in the size of the group. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02457 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Oriented Diameter of Power Graphs Benson, Deepu Das, Bireswar Dey, Dipan Ghosh, Jinia Combinatorics Discrete Mathematics 05C12, 05C20, 05C25, 20D15 In this paper, we study the oriented diameter of power graphs of groups. We show that a $2$-edge connected power graph of a finite group has oriented diameter at most $4$. We prove that the power graph of the cyclic group of order $n$ has oriented diameter $2$ for all $n\neq 1,2,4,6$. For non-cyclic finite nilpotent groups, we show that the oriented diameter of corresponding power graphs is at least $3$. Moreover, we provide necessary and sufficient conditions for the oriented diameter of $2$-edge connected power graphs of finite non-cyclic nilpotent groups to be either $3$ or $4$. This, in turn, gives an algorithm for computing the oriented diameter of the power graph of a given nilpotent group that runs in time polynomial in the size of the group. |
| title | On Oriented Diameter of Power Graphs |
| topic | Combinatorics Discrete Mathematics 05C12, 05C20, 05C25, 20D15 |
| url | https://arxiv.org/abs/2409.02457 |