English
Related papers

Related papers: Neumaier Cayley graphs

200 papers

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

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

Combinatorics · Mathematics 2007-05-23 Dongseok Kim , Jin Hwan Kim , Jaeun Lee , Dianjun Wang

A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for…

Combinatorics · Mathematics 2026-01-26 Nino Bašić , Ivan Damnjanović

In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence, we show that…

Combinatorics · Mathematics 2020-12-18 Gary R. W. Greaves , Jack H. Koolen , Jongyook Park

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and…

Combinatorics · Mathematics 2016-08-08 Edward Dobson , Ademir Hujdurović , Martin Milanič , Gabriel Verret

A regular $t$-balanced Cayley map on a group $\Gamma$ is an embedding of a Cayley graph on $\Gamma$ into a surface with certain special symmetric properties. We completely classify regular $t$-balanced Cayley maps for a class of split…

Combinatorics · Mathematics 2024-02-09 Haimiao Chen , Jingrui Zhang

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

Combinatorics · Mathematics 2019-11-05 Primož Potočnik , Janoš Vidali

We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.

Combinatorics · Mathematics 2022-04-25 Xiaogang Liu , Sanming Zhou

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

Combinatorics · Mathematics 2018-11-08 Yu-pei Huang , Chia-an Liu , Chih-wen Weng

The graph $G$ is said to be strongly regular with parameters $(n,k,\lambda,\mu)$ if the following conditions hold: (1) each vertex has $k$ neighbours; (2) any two adjacent vertices of $G$ have $\lambda$ common neighbours; (3) any two…

Combinatorics · Mathematics 2021-10-06 Jeepamol J Palathingal , Aparna Lakshmanan S , Greg Markowsky

For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…

Combinatorics · Mathematics 2013-02-12 Gabor Somlai

In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is self-complementary strongly regular. We also deal with…

Combinatorics · Mathematics 2023-01-18 Mojtaba Jazaeri

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…

Combinatorics · Mathematics 2017-08-01 Jiangmin Pan , Fugang Yin , Bo Ling

In this paper, we study new Cayley graphs over the additive group of Galois rings. First we prove that they are expander graphs by using a Weil-Carlitz-Uchiyama type estimation of character sums for Galois rings. We also show that Cayley…

Combinatorics · Mathematics 2019-03-05 Shohei Satake

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

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

Combinatorics · Mathematics 2012-11-13 Endre Csoka , Gabor Lippner

Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…

Combinatorics · Mathematics 2007-05-23 Yefim I. Leifman , Mikhail E. Muzychuk

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if the right-regular representation of $G$ is normal in $\Aut\Ga$. In this paper, we investigate the normality problem of the connected 13-valent symmetric Cayley graphs $\Ga$ of finite…

Combinatorics · Mathematics 2024-12-25 Bengong Lou , Zheng Zuo , Bo Ling

We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and…

Commutative Algebra · Mathematics 2019-07-24 Miguel Eduardo Uribe-Paczka , Adam Van Tuyl

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

Social and Information Networks · Computer Science 2017-07-03 Massimo Franceschet , Enrico Bozzo