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

preprint2020arXivOpen access

Abstract

Let GG be a finite group. Define a graph on the set G#=G∖{1}G^{\#} = G \setminus \{ 1 \} by declaring distinct elements x,y∈G#x,y\in G^{\#} to be adjacent if and only if ⟨x,y⟩\langle x,y\rangle is cyclic. Denote this graph by Δ(G)Δ(G). The graph Δ(G)Δ(G) has appeared in the literature under the names cyclic graph and deleted enhanced power graph. If GG and HH are nontrivial groups, then Δ(G×H)Δ(G\times H) is completely characterized. In particular, if Δ(G×H)Δ(G\times H) is connected, then a diameter bound is obtained, along with an example meeting this bound. Also, necessary and sufficient conditions for the disconnectedness of Δ(G×H)Δ(G\times H) are established.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.