English
Related papers

Related papers: Directed Strongly Regular Cayley Graphs on Dihedra…

200 papers

In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…

Group Theory · Mathematics 2025-11-04 Costantino Delizia , Michele Gaeta , Carmine Monetta

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

Combinatorics · Mathematics 2024-02-27 Prajnanaswaroopa S

Assume G is a finite group, such that |G|= 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2025-09-30 Farzad Maghsoudi

The unipotent subgroup of a finite group of Lie type over a prime field Z/pZ comes equipped with a natural set of generators; the properties of the Cayley graph associated to this set of generators have been much studied. In the present…

Group Theory · Mathematics 2007-05-23 Jordan S. Ellenberg , Julianna S. Tymoczko

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

Combinatorics · Mathematics 2014-02-20 Edward Dobson , Joy Morris , Pablo Spiga

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

Combinatorics · Mathematics 2025-02-14 Xiongfeng Zhan , Xueyi Huang , Lu Lu

The \emph{critical} group of a finite connected graph is an abelian group defined by the Smith normal form of its Laplacian. Let $q$ be a power of a prime and $H$ be a multiplicative subgroup of $K=\mathbb{F}_{q}$. By $\mathrm{Cay}(K,H)$ we…

Combinatorics · Mathematics 2019-06-20 Venkata Raghu Tej Pantangi

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Combinatorics · Mathematics 2008-06-11 Vladimir Retakh , Robert Lee Wilson

In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…

Combinatorics · Mathematics 2020-05-28 Vonjy Rasendrahasina , Vlady Ravelomanana

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Combinatorics · Mathematics 2023-03-08 Dave Witte Morris , Joy Morris

Suppose G is a finite group, such that |G| = 27p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2011-04-22 Ebrahim Ghaderpour , Dave Witte Morris

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Combinatorics · Mathematics 2016-02-02 Razvan Gurau , Gilles Schaeffer

For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…

Combinatorics · Mathematics 2015-01-05 Xavier Dahan

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…

Combinatorics · Mathematics 2020-06-02 Dave Witte Morris , Joy Morris , Gabriel Verret

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $\alpha\in Aut(G)$…

Combinatorics · Mathematics 2021-06-03 Jin-Hua Xie , Yan-Quan Feng , Jin-Xin Zhou

In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions…

Combinatorics · Mathematics 2012-01-04 Tao Feng , Koji Momihara , Qing Xiang

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.

Discrete Mathematics · Computer Science 2019-03-18 Didier Caucal

We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…

Discrete Mathematics · Computer Science 2015-05-05 Daniel R. Patten , Howard A. Blair , David W. Jakel , Robert J. Irwin

We prove that the group $C_p^4\times C_q$ is a DCI-group for distinct primes $p$ and $q$, that is, two Cayley digraphs over $C_p^4 \times C_q$ are isomorphic if and only if their connection sets are conjugate by a group automorphism.

Combinatorics · Mathematics 2022-01-11 István Kovács , Grigory Ryabov
‹ Prev 1 3 4 5 6 7 10 Next ›