Related papers: Perfect codes in Cayley graphs

A vertex coloring of a graph is called "perfect" if for any two colors $a$ and $b$, the number of the color-$b$ neighbors of a color-$a$ vertex $x$ does not depend on the choice of $x$, that is, depends only on $a$ and $b$ (the…

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

The Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \times…

A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Let $0<\ell\in\mathbb{Z}$. The notion of an efficient dominating set or perfect code $S$ of a graph $G$ is generalized to that of an efficient dominating$\,^\ell$-set or perfect$^\ell$code, of the graph $G$, meaning that each vertex $v$ of…

A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.

Inspired by a famous characterization of perfect graphs due to Lov\'{a}sz, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $\alpha(H) + \omega(H) \geq |V(H)|$. (Here $\alpha$ and $\omega$ denote the…

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

The graph topology $\tau_{\Gamma}$ is the topology on the space $C(X)$ of all continuous functions defined on a Tychonoff space $X$ inherited from the Vietoris topology on $X\times \mathbb R$ after identifying continuous functions with…

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Let $G$ be a group and $S\subseteq G$ its subset such that $S=S^{-1}$, where $S^{-1}=\{s^{-1}\mid s\in S\}$. Then {\it the Cayley graph ${\rm Cay}(G,S)$} is an undirected graph $\Gamma$ with the vertex set $V(\Gamma)=G$ and the edge set…

The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of the $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. In an article of 2016 Ashrafi and his co-authors proved the non-existence of perfect…

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The \textit{mixed Cayley graph} $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and…

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

This paper deals with the Cayley graph $\Cay,$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. We prove that…

Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this…