English
Related papers

Related papers: Fourier analysis on distance-regular Cayley graphs…

200 papers

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Combinatorics · Mathematics 2015-06-10 Robert R. Lewis

We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…

Combinatorics · Mathematics 2026-03-11 Iqbal Atmaja , Yeni Susanti , Ahmad Erfanian

In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over finite abelian groups to have fractional revival. As…

Combinatorics · Mathematics 2024-01-17 Jing Wang , Ligong Wang , Xiaogang Liu

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

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

Directed strongly regular graphs were introduced by Duval in 1998 as one of the possible generalization of classical strongly regular graphs to the directed case. Duval also provided several construction methods for directed strongly…

Combinatorics · Mathematics 2014-12-24 Rongquan Feng , Liwei Zeng

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…

Combinatorics · Mathematics 2024-09-04 Xing Zhang , Yuan-Quan Feng , Fu-Gang Yin , Jin-Xin Zhou

Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemer\'edi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between…

Combinatorics · Mathematics 2009-03-06 Balazs Szegedy

A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram…

Combinatorics · Mathematics 2021-04-23 F. Aguiló , M. A. Fiol , S. Pérez

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…

Combinatorics · Mathematics 2025-07-30 Zai Ping Lu , Jia Yin Xie , Jin-Hua Xie

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…

Combinatorics · Mathematics 2016-09-05 Tilen Marc

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

Combinatorics · Mathematics 2024-02-27 Haimiao Chen

It is shown that distance powers of an integral Cayley graph over an abelian group are again integral Cayley graphs over that group. Moreover, it is proved that distance matrices of integral Cayley graphs over abelian groups have integral…

Combinatorics · Mathematics 2012-06-21 W. Klotz , T. Sander

We apply Fourier analysis on finite groups to obtain simplified formulations for the Lov\'asz theta-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a…

Optimization and Control · Mathematics 2014-06-19 Evan DeCorte , David de Laat , Frank Vallentin

Duval, in "A Directed Graph Version of Strongly Regular Graphs" [{\it Journal of Combinatorial Theory}, Series A 47 (1988) 71 - 100], introduced the concept of directed strongly regular graphs. In this paper we construct several rich…

Combinatorics · Mathematics 2015-10-02 Jerod Michel , Baokun Ding

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

Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest…

Combinatorics · Mathematics 2023-06-02 John Polhill , James Davis , Ken Smith , Eric Swartz

Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…

Rings and Algebras · Mathematics 2019-01-03 Somphong Jitman , San Ling

In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…

Combinatorics · Mathematics 2017-06-20 Koji Momihara , Qing Xiang

We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…

Combinatorics · Mathematics 2021-10-07 Kolja Knauer , Gil Puig i Surroca