| dc.contributor.author |
Benson, Deepu |
|
| dc.contributor.author |
Das, Bireswar |
|
| dc.contributor.author |
Dey, Dipan |
|
| dc.contributor.author |
Ghosh, Jinia |
|
| dc.coverage.spatial |
United States of America |
|
| dc.date.accessioned |
2024-09-11T09:38:11Z |
|
| dc.date.available |
2024-09-11T09:38:11Z |
|
| dc.date.issued |
2024-09 |
|
| dc.identifier.citation |
Benson, Deepu; Das, Bireswar; Dey, Dipan and Ghosh, Jinia, "On oriented diameter of power graphs", arXiv, Cornell University Library, DOI: arXiv:2409.02457, Sep. 2024. |
|
| dc.identifier.uri |
http://arxiv.org/abs/2409.02457 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/10412 |
|
| dc.description.abstract |
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 a cyclic group of order n has oriented diameter 2 for all n≠2,4,6. Until our work, to the best of our knowledge, no infinite family of graphs with oriented diameter 2 had been identified except for subclasses of complete graphs. Finally, we give a complete characterization of the oriented diameter of the power graphs of nilpotent groups. 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. |
|
| dc.description.statementofresponsibility |
by Deepu Benson, Bireswar Das, Dipan Dey and Jinia Ghosh |
|
| dc.language.iso |
en_US |
|
| dc.publisher |
Cornell University Library |
|
| dc.title |
On oriented diameter of power graphs |
|
| dc.type |
Article |
|
| dc.relation.journal |
arXiv |
|