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

DOI10.2140/INVOLVE.2021.14.167MaRDI QIDQ2037263zbMATH OpenOpenAlexFDO

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

Publication date 30 June 2021

Published in Involve (Search for Journal in Brave)

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

zbMATH Keywords

direct productscyclic graphsdeleted enhanced power graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

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.

Recommendations

• The cyclic graph of a finite group.
• Noncyclic Graph of a Group
• Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups
• HAMILTONIAN CYCLE IN THE POWER GRAPH OF DIRECT PRODUCT TWO p-GROUPS OF PRIME EXPONENTS
• Vertex connectivity of the power graph of a finite cyclic group. II

Cites work

• A condition in finite solvable groups related to cyclic subgroups.
• Certain properties of the power graph associated with a finite group.
• Nested colourings of graphs
• On enhanced power graphs of finite groups
• On the connectivity of proper power graphs of finite groups
• Some properties of power graphs in finite group
• The Magma algebra system. I: The user language
• The commuting graph of a soluble group.
• The diameter of the commuting graph of a finite group with trivial centre.
• The groups of order at most 2000
• The primitive permutation groups of degree less than 4096.
• There is no upper bound for the diameter of the commuting graph of a finite group

Cited in

(7)

• Forbidden subgraphs in enhanced power graphs of finite groups
• Strong metric dimensions for power graphs of finite groups
• scientific article; zbMATH DE number 7552774 (Why is no real title available?)
• THE CYCLIC GRAPH OF A Z-GROUP
• A survey on enhanced power graphs of finite groups
• A graph related to the sum of element orders of a finite group
• On the proper enhanced power graphs of finite nilpotent groups

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)