Related papers: The Smith and critical groups of Paley graphs

Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in…

The critical group of a finite graph is an abelian group defined by the Smith normal form of the Laplacian. We determine the the critical groups of the Peisert graphs, a certain family of strongly regular graphs similar to, but different…

To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…

We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…

Let $k \geq 2$ be an integer. Let $q$ be a prime power such that $q \equiv 1 \pmod {k}$ if $q$ is even, or, $q \equiv 1 \pmod {2k}$ if $q$ is odd. The generalized Paley graph of order $q$, $G_k(q)$, is the graph with vertex set…

We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…

The critical group of a connected graph is closely related to the graph Laplacian, and is of high research value in combinatorics, algebraic geometry, statistical physics, and several other areas of mathematics. In this paper, we study the…

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…

Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…

The $n$-cube graph is the graph on the vertex set of $n$-tuples of $0$s and $1$s, with two vertices joined by an edge if and only if the $n$-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently,…

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Let $ G $ be a finite group of order $ n$. The strong power graph $\mathcal{P}_s(G) $ of $G$ is the undirected graph whose vertices are the elements of $G$ such that two distinct vertices $a$ and $b$ are adjacent if $a^{{m}_1}$=$b^{{m}_2}$…

The power graph of a group $G$ is a simple and undirected graph with vertex set $G$ and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and…

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

The power graph \( \mathcal{G}_G \) of a group \( G \) is a graph whose vertex set is \( G \), and two elements \( x, y \in G \) are adjacent if one is an integral power of the other. In this paper, we determine the adjacency, Laplacian,…

In this paper, the Grothendieck group of the Leavitt path algebra over the power graphs of all prime-power cyclic groups is studied by using a well-known computation from linear algebra. More precisely, the Smith normal form of the matrix…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…