English
Related papers

Related papers: New constructions of strongly regular Cayley graph…

200 papers

In this paper, generalizing the result in \cite{GXY}, we construct strongly regular Cayley graphs by using union of cyclotomic classes of $\F_q$ and Gauss sums of index $w$, where $w\geq 2$ is even. In particular, we obtain three infinite…

Combinatorics · Mathematics 2012-08-07 Fan Wu

A well-known conjecture due to van Lint and MacWilliams states that if $A$ is a subset of $\mathbb{F}_{q^2}$ such that $0,1 \in A$, $|A|=q$, and $a-b$ is a square for each $a,b \in A$, then $A$ must be the subfield $\mathbb{F}_q$. This…

Combinatorics · Mathematics 2022-08-30 Shamil Asgarli , Chi Hoi Yip

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

Group Theory · Mathematics 2014-06-13 Ergün Yaraneri

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

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…

Combinatorics · Mathematics 2013-10-03 Joy Morris , Pablo Spiga , Gabriel Verret

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

Combinatorics · Mathematics 2026-01-19 Boštjan Kuzman , Primož Šparl

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…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle

The sandpile group of a connected graph $G$, defined to be the torsion part of the cokernel of the graph Laplacian, is a subtle graph invariant with combinatorial, algebraic, and geometric descriptions. Extending and improving previous…

Combinatorics · Mathematics 2024-04-18 Jiyang Gao , Jared Marx-Kuo , Vaughan McDonald , Chi Ho Yuen

We apply spectral analysis of quotients of the Bruhat-Tits buildings of type $\tilde{A}_{d-1}$ to construct isospectral non-isomorphic Cayley graphs of the finite simple groups $\operatorname{PSL}_d({\mathbb F}_q)$ for every $d \geq 5$ ($d…

Combinatorics · Mathematics 2007-05-23 Alexander Lubotzky , Beth Samuels , Uzi Vishne

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

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

We give a construction of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 4 Gauss sums. In particular, we obtain two infinite families of strongly regular graphs with new parameters.

Combinatorics · Mathematics 2012-04-03 Gennian Ge , Qing Xiang , Tao Yuan

We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known…

Combinatorics · Mathematics 2019-08-27 Ignacio García-Marco , Kolja Knauer , Guillaume Mercui-Voyant

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

Group Theory · Mathematics 2017-10-03 Cheryl E. Praeger , Jacqui Ramagge , George Willis

In this paper, we construct a higher dimensional generalization of affine buildings and introduce a new structure, which we call Babel buildings. These buildings are non-connected, non-convex metric spaces of non-positive curvature. Despite…

Group Theory · Mathematics 2025-12-23 Masaoki Mori

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

Combinatorics · Mathematics 2007-07-03 Joy Morris , Pablo Spiga , Kerri Webb

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. In this paper we give conditions for when a Cayley graph on an abelian group can be represented as a…

Combinatorics · Mathematics 2022-05-04 Joy Morris , Adrian Skelton

Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…

Group Theory · Mathematics 2026-04-01 Asgar Jamneshan , Andreas Thom

We give two constructions of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 2 Gauss sums. In particular, we obtain twelve infinite families of strongly regular graphs with new…

Combinatorics · Mathematics 2011-11-01 Tao Feng , Qing Xiang
‹ Prev 1 4 5 6 7 8 10 Next ›