English
Related papers

Related papers: Self-complementary distance-regular Cayley graphs …

200 papers

The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs…

Combinatorics · Mathematics 2013-08-05 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…

Combinatorics · Mathematics 2016-06-13 Sho Kubota

We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…

Combinatorics · Mathematics 2023-08-01 Binzhou Xia , Shasha Zheng

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

Combinatorics · Mathematics 2023-04-20 Babak Miraftab , Dave Witte Morris

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $\Gamma_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include…

Combinatorics · Mathematics 2025-11-19 Sauvik Poddar , Sucharita Biswas , Angsuman Das

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

Combinatorics · Mathematics 2019-08-14 Yan-Quan Feng , István Kovács , Jie Wang , Da-Wei Yang

In this paper, we show that every bipartite distance-regular Cayley graph with diameter $3$ can be constructed on the semidirect product of a group and $\mathbb{Z}_{2}$, except possibly for one case.

Combinatorics · Mathematics 2021-09-29 Mojtaba Jazaeri

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

We investigate special structures due to automorphisms in isogeny graphs of principally polarized abelian varieties, and abelian surfaces in particular. We give theoretical and experimental results on the spectral and statistical properties…

Cryptography and Security · Computer Science 2022-01-20 Enric Florit , Benjamin Smith

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley graphs over finite abelian groups admitting fractional…

Combinatorics · Mathematics 2023-08-07 Jing Wang , Ligong Wang , Xiaogang Liu

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Combinatorics · Mathematics 2018-10-09 Ali Sltan Ali AL-Tarimshawy

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Combinatorics · Mathematics 2014-11-14 S. De Winter , E. Kamischke , Z. Wang

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

Combinatorics · Mathematics 2026-05-06 Julia Baligacs , Sofia Brenner , Annette Lutz , Lena Volk

In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly…

Combinatorics · Mathematics 2017-05-23 Koji Momihara

In this paper, we construct some non-normal Cayley graphs and explicitly provide their spectra and eigenspaces using representation theory of finite groups.

Combinatorics · Mathematics 2025-04-08 Yang Chen , Xuanrui Hu

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

Probability · Mathematics 2011-11-10 Alex Gamburd , Shlomo Hoory , Mehrdad Shahshahani , Aner Shalev , Balint Virag

Let $R$ be a finite ring with identity. The unit graph (unitary Cayley graph) of $R$ is the graph with vertex set $R$, where two distinct vertices $x$ and $y$ are adjacent exactly whenever $x+y$ is a unit in $R$ ($x-y$ is a unit in $R$).…

Combinatorics · Mathematics 2024-04-11 Shahin Rahimi , Ashkan Nikseresht

In this paper, we consider regular automorphism groups of graphs in the RT$2$ family and the Davis-Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non-abelian regular…

Combinatorics · Mathematics 2019-10-18 Tao Feng , Zhiwen He , Yu Qing Chen

Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $i:a\mapsto a^{-1}$. A Cayley graph $\Gamma=\mathrm{Cay}(A,S)$ is said to have an automorphism group \emph{as small as possible} if $\mathrm{Aut}(\Gamma)=…

Combinatorics · Mathematics 2014-05-09 Edward Dobson , Pablo Spiga , Gabriel Verret
‹ Prev 1 4 5 6 7 8 10 Next ›