English
Related papers

Related papers: Non-expander Cayley graphs of simple groups

200 papers

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

Does every $n$-vertex Cayley graph have an orthonormal eigenbasis all of whose coordinates are $O(1/\sqrt{n})$? While the answer is yes for abelian groups, we show that it is no in general. On the other hand, we show that every $n$-vertex…

Combinatorics · Mathematics 2020-10-29 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

Combinatorics · Mathematics 2019-06-26 David Conlon

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

Combinatorics · Mathematics 2017-07-12 Yan-Quan Feng , Istvan Kovacs , Da-Wei Yang

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

Combinatorics · Mathematics 2022-03-25 Xueyi Huang , Kinkar Chandra Das , Lu Lu

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

Group Theory · Mathematics 2020-08-27 Jacob Laubacher , Mark Medwid

This paper establishes connections between the structure of a semigroup and the minimum spans of distance labellings of its Cayley graphs. We show that certain general restrictions on the minimum spans are equivalent to the semigroup being…

Combinatorics · Mathematics 2015-09-04 Andrei Kelarev , Charl Ras , Sanming Zhou

A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…

Combinatorics · Mathematics 2024-05-07 Qianfen Liao , Liu Weijun

A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…

Combinatorics · Mathematics 2025-08-15 Bei Ye , Xiaogang Liu

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

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

Combinatorics · Mathematics 2026-05-01 Cameron Strachan , Konrad Swanepoel

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

Group Theory · Mathematics 2026-04-02 Sabine Chu , George Domat , Christine Gao , Ananya Prasanna , Alex Wright

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

Combinatorics · Mathematics 2007-10-08 David J. Grynkiewicz , Oriol Serra , Vsevolod Lev

We develop a systematical way of constructing S-Ricci flat graphs which are not Abelian Cayley via graph bundle with explicit examples. For this purpose, we prove that, with some natural constrains, a non-trivial graph bundle can not be…

Differential Geometry · Mathematics 2025-02-14 Wenbo Li , Shiping Liu

Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be…

Combinatorics · Mathematics 2012-10-23 Primoz Potocnik , Pablo Spiga , Gabriel Verret

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$…

Combinatorics · Mathematics 2025-06-05 Nino Bašić , Ivan Damnjanović , Patrick W. Fowler

Let $G$ be a (finite or infinite) group such that $G/Z(G)$ is not simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with vertices $x$ and $y$ adjacent whenever $[x,y] \ne 1$ and $\langle x, y…

Group Theory · Mathematics 2023-11-13 Saul D. Freedman

It is known that splittings of finitely presented groups over 2-ended groups can be characterized geometrically. We show that this characterization does not extend to all finitely generated groups. Answering a question of Kleiner we show…

Group Theory · Mathematics 2009-11-03 Panos Papasoglu

We give an introduction to the Cayley-Abels graph for a totally disconnected, locally compact (tdlc) group. It is a generalization of the Cayley graph. We illustrate that on the one hand, Cayley-Abels graphs are useful tools to extend…

Group Theory · Mathematics 2022-10-31 Waltraud Lederle

We prove that if G is SL_2(F) or PSL_2(F), where F is a finite field, and A is a set of generators of G, then either |AAA| > |A|^(1+epsilon), where epsilon is an absolute positive real number, or AAA=G. As a corollary we get that the…

Group Theory · Mathematics 2010-10-08 Oren Dinai