Related papers: Normality of one-matching semi-Cayley graphs over …

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(a,b)$-regular if $C$ induces an $a$-regular subgraph and every vertex outside $C$ is adjacent to exactly $b$ vertices in $C$. In particular, if $C$ is an $(a,b)$-regular set…

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…

We study finite four-valent graphs Gamma admitting an edge-transitive group G of automorphisms such that G determines and preserves an edge-orientation on Gamma, and such that at least one G-normal quotient is a cycle (a quotient modulo the…

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

A total perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that every vertex of $\Gamma$ is adjacent to exactly one vertex in $C$. We give necessary and sufficient conditions for a conjugation-closed subset of a group to…

A Cayley graph on a group $G$ has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation of $G$. A group…

Let $\Gamma$ denote a bipartite graph with vertex set $X$, color partitions $Y$, $Y'$, and assume that every vertex in $Y$ has eccentricity $D\ge 3$. For $z\in X$ and a non-negative integer $i$, let $\Gamma_{i}(z)$ denote the set of…

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…

This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Any gentle algebra $A$ with one maximal path corresponds to a unique quasi-diagram $\alpha$. We introduce the regularity for $\alpha$, and show that $A$ has finite global dimension if and only if $\alpha$ is regular. We characterize regular…

Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joint if and only if they do not commute. In a finite simple…

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 connected graph $\Gamma$ of diameter ${\rm diam}(\Gamma) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}(\Gamma)|=|W_{yx}(\Gamma)|$ for every $x,y\in V(\Gamma)$ with $d_{\Gamma}(x,y)=\ell$, where $W_{xy}(\Gamma)$ is the set of vertices…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…