English
Related papers

Related papers: On solid density of Cayley digraphs on finite Abel…

200 papers

In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…

Combinatorics · Mathematics 2020-09-08 Carl Bürger , Ruben Melcher

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Group Theory · Mathematics 2020-02-18 Andrea Lucchini

Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…

Functional Analysis · Mathematics 2018-02-19 Maria Gerasimova , Dominik Gruber , Nicolas Monod , Andreas Thom

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

Given a finite group $G$ and its representation $\rho$, the corresponding McKay graph is a graph $\Gamma(G,\rho)$ whose vertices are the irreducible representations of $G$; the number of edges between two vertices $\pi,\tau$ of…

Representation Theory · Mathematics 2022-08-02 Avraham Aizenbud , Inna Entova-Aizenbud

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed strongly regular Cayley graphs on dihedral groups…

Combinatorics · Mathematics 2019-09-20 Yiqin He , Bicheng Zhang , Rongquan Feng

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

Combinatorics · Mathematics 2021-01-08 R. A. Bailey , Peter J. Cameron

We prove that any $n$-node graph $G$ with diameter $D$ admits shortcuts with congestion $O(\delta D \log n)$ and dilation $O(\delta D)$, where $\delta$ is the maximum edge-density of any minor of $G$. Our proof is simple, elementary, and…

Data Structures and Algorithms · Computer Science 2020-08-10 Mohsen Ghaffari , Bernhard Haeupler

A finite group $G$ admits an {\em oriented regular representation} if there exists a Cayley digraph of $G$ such that it has no digons and its automorphism group is isomorphic to $G$. Let $m$ be a positive integer. In this paper, we extend…

Group Theory · Mathematics 2022-08-09 Jia-Li Du , Yan-Quan Feng , Sejeong Bang

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Group Theory · Mathematics 2025-04-03 Murray Elder , Adam Piggott , Florian Stober , Alexander Thumm , Armin Weiß

We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…

Combinatorics · Mathematics 2015-03-30 Štefan Gyürki , Mikhail Klin

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

Group Theory · Mathematics 2019-08-14 Zoltán Halasi , Attila Maróti , László Pyber , Youming Qiao

The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.

Combinatorics · Mathematics 2014-03-31 Cristóbal Camarero , Carmen Martínez , Ramón Beivide

In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$. We show that if the diameter is at least…

Combinatorics · Mathematics 2010-08-09 Jack H. Koolen , Jongyook Park

Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…

Combinatorics · Mathematics 2023-01-25 Blas Fernández

Let $\Gamma$ be a connected $7$-valent symmetric Cayley graph on a finite non-abelian simple group $G$. If $\Gamma$ is not normal, Li {\em et al.} [On 7-valent symmetric Cayley graphs of finite simple groups, J. Algebraic Combin. 56 (2022)…

Group Theory · Mathematics 2024-10-08 Xing Zhang , Yan-Quan Feng , Fu-Gang Yin , Hong Wang

In this paper, we show that the edge connectivity of a distance-regular digraph $\Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $\Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover…

Combinatorics · Mathematics 2017-02-07 S. Ashkboos , G. R. Omidi , F. Shafiei , K. Tajbakhsh

We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k=\theta_0>\theta_1>... >\theta_d$. We show the intersection numbers $a_1, b_1$ satisfy $$ (\theta_1 + {k \over a_1+1}) (\theta_d + {k \over a_1+1}) \ge -…

Combinatorics · Mathematics 2007-05-23 Aleksandar Jurisic , Jack Koolen , Paul Terwilliger

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

Group Theory · Mathematics 2021-04-20 Tanakorn Udomworarat , Teerapong Suksumran

Let $X$ be a product of locally compact rank one Hadamard spaces and $\Gamma$ a discrete group of isometries which contains two elements projecting to a pair of independent rank one isometries in each factor. In [arXiv:1308.5584] we gave a…

Metric Geometry · Mathematics 2014-03-20 Gabriele Link
‹ Prev 1 8 9 10 Next ›