Abstract
Let be a finite group. Define a graph on the set by declaring distinct elements to be adjacent if and only if is cyclic. Denote this graph by . The graph has appeared in the literature under the names cyclic graph and deleted enhanced power graph. If and are nontrivial groups, then is completely characterized. In particular, if is connected, then a diameter bound is obtained, along with an example meeting this bound. Also, necessary and sufficient conditions for the disconnectedness of are established.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.