The cyclic graph (deleted enhanced power graph) of a direct product

From MaRDI portal
Publication:2037263

DOI10.2140/INVOLVE.2021.14.167zbMATH Open1506.20057arXiv2005.05828OpenAlexW3134124666MaRDI QIDQ2037263FDOQ2037263

Stefano Schmidt, Eyob Tsegaye, Gabe Udell, Mark L. Lewis, David G. Costanzo

Publication date: 30 June 2021

Published in: Involve (Search for Journal in Brave)

Abstract: Let G be a finite group. Define a graph on the set by declaring distinct elements to be adjacent if and only if langlex,yangle is cyclic. Denote this graph by Delta(G). The graph Delta(G) has appeared in the literature under the names cyclic graph and deleted enhanced power graph. If G and H are nontrivial groups, then Delta(GimesH) is completely characterized. In particular, if Delta(GimesH) is connected, then a diameter bound is obtained, along with an example meeting this bound. Also, necessary and sufficient conditions for the disconnectedness of Delta(GimesH) are established.


Full work available at URL: https://arxiv.org/abs/2005.05828





Cites Work


Cited In (7)






This page was built for publication: The cyclic graph (deleted enhanced power graph) of a direct product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037263)