Cayley graph

In this study, we review two significant topics: perfect State Transfer (PST) and Pretty Good State Transfer (PGST). These concepts involve designing interactions within a chain of spins on graph structures of networks, enabling a quantum state initially placed at one end to be perfectly or pretty transferred to the opposite end within a specified timeframe. PST and PGST play crucial roles in applications such as quantum information processing, quantum communication networks, and quantum chemistry

For $n \ge 2t+1$ where $t \ge 1$, the circulant graph $C_n (1, 2, \dots , t)$ consists of the vertices $v_0, v_1, v_2, \dots , v_{n-1}$ and the edges $v_i v_{i+1}$, $v_i v_{i+2}, \dots , v_i v_{i + t}$, where $i = 0, 1, 2, \dots , n-1$, and the subscripts are taken modulo $n$. We prove that the metric dimension ${\rm dim} (C_n (1, 2, \dots , t)) \ge \left\lceil \frac{2t}{3} \right\rceil + 1$ for $t \ge 5$, where the equality holds if and only if $t = 5$ and $n = 13$. Thus ${\rm dim} (C_n (1, 2, \dots , t)) \ge \left\lceil \frac{2t}{3} \right\rceil + 2$ for $t \ge 6$. This bound is sharp for every $t \ge 6$.

It has been conjectured there is a Hamiltonian cycle in every Cayley graph. Interest in this and other closely related questions has grown in the past few years. There have been many papers on the topic, but it is still an open question whether every connected Cayley graph has a Hamiltonian cycle. In this paper, we survey the results, techniques, and open problems in the field.

In this paper the zero forcing number as well as propagation time of $Cay(G,\Omega),$ where $G$ is a finite group and $\Omega \subset G \setminus \lbrace 1 \rbrace$ is an inverse closed generator set of $G$ is studied. In particular, it is shown that the propagation time of $Cay(G,\Omega)$ is at most two for some special generators.

Perfect state transfer (\textit{PST}) on graphs due to their significant applications in quantum information processing and quantum computations. In the present work, we establish a characterization of Cayley graphs over $U_{6n}$ group, having \textit{PST}.

Let G be a finite group and S be a subset of G such that 1G ̸∈ S and S −1 = S. The Cayley graph Σ = Cay(G, S) on G with respect to S is the graph with the vertex set G such that, for §, † ∈ G, the pair (§, †) is an arc in Cay(G, S) if and only if †§−1 ∈ S. The graph Σ is said to be arc-transitive if its full automorphism group Aut(Σ) is transitive on its arc set. In this paper we give a classification for arc-transitive Cayley graphs with valency six on finite abelian groups which are non-normal. Moreover, we classify all normal Cayley graphs on non-cyclic abelian groups with valency 6.

‎Let $\Gamma$ be a finite group and $S$ be a non-empty subset of $\Gamma$‎. ‎A Cayley graph of the group $\Gamma$‎, ‎denoted by $Cay(\Gamma‎, ‎S)$ is defined as a simple graph that its vertices are the elements of $\Gamma$ and two vertices $u$ and $v$ are adjacent if $uv^{-1} \in \Gamma$. ‎The minimum edge dominating energy of Cayley graph $Cay(\Gamma‎, ‎S)$ is equal to the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph $Cay(\Gamma‎, ‎S)$‎. ‎In this paper‎, ‎we estimate the minimum edge dominating energy of the Cayley graphs for the finite group $S_n$‎.

Perfect state transfer (\textit{PST}) on graphs due to their significant applications in quantum information processing and quantum computations. In the present work, we establish a characterization of Cayley graphs over $U_{6n}$ group, having \textit{PST}.

Let $\Gamma$ be a $k-$regular graph with the second maximum  eigenvalue $\lambda$. Then  $\Gamma$ is said o be Ramanujan graph if $\lambda\leq 2\sqrt{k-1}.$ Let $G$ be a finite group  and $\Gamma=Cay(G,S)$ be a Cayley graph related to $G$.  The aim of this paper is to investigate the Ramanujan Cayley graphs of sporadic groups.

The minimum edge dominating energy of a graph $G$ is defined as the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of $G$. In this paper, for some finite symmetric groups $\Gamma$ and subset $S$ of $\Gamma$, the minimum edge dominating energy of the Cayley graph of the group $\Gamma$, denoted by $Cay(\Gamma, S)$, is investigated.

A graph is called one-regular if its full automorphism group acts regularly on the set of arcs. In this paper, we classify all connected one-regular graphs of valency 4 of order $p^2q^2$, where $p>q$ are prime numbers. We also prove that all such graphs are Cayley graphs.

Let $\Gamma=(V, E)$ be a simple graph. A set $C$ of vertices $\Gamma$ is an identifying set of $\Gamma$ if for every two vertices $x$ and $y$ the sets $N_{\Gamma}[x] \cap C$ and $N_{\Gamma}[y] \cap C$ are non-empty and different. Given a graph $\Gamma,$ the smallest size of an identifying set of $\Gamma$ is called the identifying code number of $\Gamma$ and is denoted by $\gamma^{ID}(\Gamma).$ Two vertices $x$ and $y$ are twins when $N_{\Gamma}[x]=N_{\Gamma}[y].$ Graphs with at least two twin vertices are not identifiable graph. In this paper, we study identifying code number of some Cayley graphs.

The aim of this paper is to extend the notion of geometric groups to geometric hypergroups and to investigate the interaction between algebraic and geometric properties of hypergroups. In this regard, we first define a metric structure on hypergroups via word metric and present some examples on it by using generalized Cayley graphs over hypergroups. Then we study a large scale of geometry with respect to the structure of hypergroups and we prove that metric spaces of finitely generated hypergroups coming from different generating sets are quasi-isometric.

In this article, we study connections between components of the Cayley graph Cay(G,A), where A is an arbitrary subset of a group G, and cosets of the subgroup of G generated by A. In particular, we show how to construct generating sets of G if Cay(G,A) has finitely many components. Furthermore, we provide an algorithm for finding minimal generating sets of finite groups using their Cayley graphs.

Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called emph{sharply $t$-transitive} if for any given pair of $t$-tuples, exactly one element of $S$ carries the first to the second. In addition, a subset $S$ of $S_n$ is called $t$-intersecting if $fix(h^{-1}g)geq t$ for any two distinct permutations $h$ and $g$ of $S$. In this paper, we prove that there are only two sharply $(n-2)$-transitive subsets of $S_n$ and finally we establish some relations between sharply $k$-transitive subsets and $t$-intersecting subsets of $S_n$ where $k,tin mathbb{Z}$ and $0leq tleq kleq n$.

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its congraphs.

‎In this paper‎, ‎we investigate domination number‎, ‎$gamma$‎, ‎as well‎ ‎as signed domination number‎, ‎$gamma_{_S}$‎, ‎of all cubic Cayley‎ ‎graphs of cyclic and quaternion groups‎. ‎In addition‎, ‎we show that‎ ‎the domination and signed domination numbers of cubic graphs depend‎ on each other‎.

The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first  we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as  Hamiltonian cycles in this  graph.  Also, by some of examples we will illustrate  the properties and behavior of  these Cayley  graphs, in particulars we show that the properties of a Cayley graph associated to a semihypergroup is  completely   different  with respect to the Cayley graph associated to a  semigroup(group). Also, we briefly discuss on category of Cayley graphs associated to  semihypergroups and construct a functor from this category to the category of digraphs. Finally, we  give an application the  Cayley graph of a hypergroupoid to a social network.

A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.