相关论文: On the asymptotic enumeration of Cayley graphs

In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs). More precisely, we show that as $r$ tends to infinity, for every finite group…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

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…

We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

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…

We say that a finite group G is "DRR-detecting" if, for every subset S of G, either the Cayley digraph Cay(G,S) is a digraphical regular representation (that is, its automorphism group acts regularly on its vertex set) or there is a…

A necessary condition for a Cayley digraph Cay$(R,S)$ to be a regular representation is that there are no non-trivial group automorphisms of $R$ that fix $S$ setwise. A group is DRR-detecting or GRR-detecting if this condition is also…

For any finite group $G$, a natural question to ask is the order of the smallest possible automorphism group for a Cayley graph on $G$. A particular Cayley graph whose automorphism group has this order is referred to as an MRR (Most Rigid…

For groups $G$ that can be generated by an involution and an element of odd prime order, this paper gives a sufficient condition for a certain Cayley graph of $G$ to be a graphical regular representation (GRR), that is, for the Cayley graph…

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

The concept of directed strongly regular graphs (DSRG) was introduced by Duval in 1988 \cite{A}.In the present paper,we use representation theory of finite groups in order to investigate the directed strongly regular Cayley graphs.We first…

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

The standard double cover of a graph $\Gamma$ is the direct product $\Gamma\times K_2$. A graph $\Gamma$ is said to be stable if all the automorphisms of $\Gamma\times K_2$ come from its factors. Although the study of stability has…

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

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…

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 Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on…