On the Generating Graph of Finite Abelian Groups
Kavita Samant, A. Satyanarayana Reddy
Abstract
The generating graph Γ(G) of a group G is the graph whose vertex set is G, where two distinct vertices are adjacent if and only if they generate G. In this paper, we systematically study the structure of generating graphs of finite abelian groups (non-cyclic) and determine the set of all generating pairs. Moreover, we give some structural characterizations, in particular, we determine conditions under which Γ(G) is regular, characterize when the isolated vertices form a subgroup, and establish necessary and sufficient conditions for two non-isomorphic finite abelian groups G and H to satisfy Γ(G) Γ(H). Furthermore, we compute the spectra of the adjacency and Laplacian matrices of these graphs.
Create a lesson
Related papers
On Unavoidable Faces of High-Dimensional Polytopes
Jesús A. De Loera, Ethan X. Fang, Shengtao Guo et al.
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
List coloring C3-free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe et al.
On the gonality of Kneser graphs
Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins et al.
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
Varieties of chain complexes and mixed dimer covers
Portia X. Anderson, Esther Banaian, Melanie J. Ferreri et al.