Graphs related to finite abelian groups

Abstract EN

Let A be a finite abelian group, An undirected graph G (4) of a finite group A is introduced and defined as an undirected simple graph whose vertex set is V (G) and two distinct vertices u and v are adjacent if and only if u2 ^ v2.

In this paper, for a finite group A = (Ln, .), the degrees of vertices, the number of edges of G(A), the eccentricity, diameter, girth, chromatic number are computed.

Furthermore, Hamiltonian and Eulerian cycles of G are proposed