相关论文: Perfect codes in Cayley graphs

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{eqnarray*} V(\Gamma) &=& \{(x,y) \ | \ x \in V(X) \ \& \ y…

Let $G=(V,E)$ be a graph and let $A_G$ be the clique-vertex incidence matrix of $G$. It is well known that $G$ is perfect iff the system $A_{_G}\mathbf x\le \mathbf 1$, $\mathbf x\ge\mathbf0$ is totally dual integral (TDI). In 1982, Cameron…

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the…

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

A vertex subset $S$ of a graph $G$ is a dominating set if every vertex of $G$ either belongs to $S$ or is adjacent to a vertex of $S$. The cardinality of a smallest dominating set is called the dominating number of $G$ and is denoted by…

These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…

Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv…

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

A graph $\Gamma$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $\Gamma$ is called regular whenever for any…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

By definition, a group $G$ is quasi-perfect, if $G$ is perfect or the commutator subgroup of $G$ is perfect. In this note we give a description of quasi-perfect Dyer groups by properties of the corresponding Dyer graphs.

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…