相关论文: Detecting Graphical and Digraphical Regular Repres…

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…

A graph $\Gamma$ is said to be unstable if for the direct product $\Gamma \times K_2$, $Aut(\Gamma \times K_2)$ is not isomorphic to $Aut(\Gamma) \times \mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley graph…

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $a^\iota=a^{-1}$, for every…

A Cayley digraph $\rm{Cay}(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called a CI-digraph if for any Cayley digraph $\rm{Cay}(G,T)$ isomorphic to $\rm{Cay}(G,S)$, there is an $\alpha\in \rm{Aut}(G)$ such that $S^\alpha=T$.…

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR. First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete…

In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…

We determine two new infinite families of Cayley graphs that admit colour-preserving automorphisms that do not come from the group action. By definition, this means that these Cayley graphs fail to have the CCA (Cayley Colour Automorphism)…

In this paper, we provide a characterization of uniquely representable two-directional orthogonal ray graphs, which are defined as the intersection graphs of rightward and downward rays. The collection of these rays is called a…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…

A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic…

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed strongly regular Cayley graphs on dihedral groups…

In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.

A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the…

A $d$-regular graph $X$ is called $d$-rainbow domination regular or $d$-RDR, if its $d$-rainbow domination number $\gamma_{rd}(X)$ attains the lower bound $n/2$ for $d$-regular graphs, where $n$ is the number of vertices. In the paper, two…

Let $G$ be a (finite or infinite) group, and let $K_G = \mathrm{Cay} ( G;G \smallsetminus \{1\} )$ be the complete graph with vertex set $G$, considered as a Cayley graph of $G$. Being a Cayley graph, it has a natural edge-colouring by sets…

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…