Related papers: On Cayley graphs over generalized dicyclic groups

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$.…

It is shown that a Cayley multigraph over a group $G$ with generating multiset $S$ is integral (i.e., all of its eigenvalues are integers) if $S$ lies in the integral cone over the boolean algebra generated by the normal subgroups of $G$.…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…

A graph $X$ is said to be {\it distance--balanced} if for any edge $uv$ of $X$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. A graph $X$ is said to be {\it strongly…

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

A Cayley digraph on a group $G$ is called NNN if the Cayley digraph is normal and its automorphism group contains a non-normal regular subgroup isomorphic to $G$. A group is called NNND-group or NNN-group if there is an NNN Cayley digraph…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

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…

The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order $ pqr $, where $ p,q $ and $ r $ are { primes,} are obtained. Further, the characteristic polynomials of these matrices…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Graph connectivity serves as a fundamental metric for evaluating the reliability and fault tolerance of interconnection networks. To more precisely characterize network robustness, the concept of cyclic connectivity has been introduced,…

Rubei et. al., established results for the distance matrix of positive weighted Petersen graphs. Focusing on the properties of the distance matrix, we generalized positive weighted Petersen graphs results to Kneser graphs. We analyzed…

In this paper we study probabilistic aspects such as subgroup commutativity degree and cyclic subgroup commutativity degree of the (generalized) dicyclic groups. We find explicit formulas for these concepts and we provide another example of…

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

Given a finite group G, we say that a subset C of G is power-closed if, for every x in C and y in <x> with <x>=<y>, we have that y lies in C. In this paper we are interested in finite Cayley digraphs Cay(G,C) over G with connection set C,…

In this paper, we characterize perfect state transfer in Cayley graphs for abelian groups that have a cyclic Sylow-2-subgroup. This generalizes a result of Ba\v{s}i\'c from 2013 where he provides a similar characterization for Cayley graphs…