English
Related papers

Related papers: Spectral properties of generalized Paley graphs

200 papers

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

Combinatorics · Mathematics 2023-03-21 Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Hanmeng Zhan

Fix positive integers $p,q,$ and $r$ so that $p$ is prime, $q=p^r$, and $q\equiv 1$ (mod $4$). Fix a graph $G$ as follows: If $r$ is odd or $p\not\equiv 3$ (mod $4$), let $G$ be the $q$-vertex Paley graph; if $r$ is even and $p\equiv 3$…

Combinatorics · Mathematics 2015-10-19 James Alexander

A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…

Combinatorics · Mathematics 2016-12-21 Geoffrey Pearce , Cheryl E Praeger

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

Combinatorics · Mathematics 2022-02-09 Arindam Biswas , Jyoti Prakash Saha

We present a method to derive the complete spectrum of the lift $\Gamma^\alpha$ of a base digraph $\Gamma$, with voltage assignments on a (finite) group $G$. The method is based on assigning to $\Gamma$ a quotient-like matrix whose entries…

Combinatorics · Mathematics 2017-07-17 C. Dalfó , M. A. Fiol , J. Širáň

A graph is called integral if its eigenvalues are integers. In this article, we provide the necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra $R$ to be integral. This generalizes the work of So who…

Number Theory · Mathematics 2025-02-06 Tung T. Nguyen , Nguyen Duy Tân

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Combinatorics · Mathematics 2022-08-10 Ferdinand Ihringer

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

Combinatorics · Mathematics 2018-02-13 Jae-Ho Lee , Hajime Tanaka

Let $\mathcal{OG}(4)$ denote the family of all graph-group pairs $(\Gamma, G)$ where $\Gamma$ is finite, 4-valent, connected, and $G$-oriented ($G$-half-arc-transitive). A subfamily of $\mathcal{OG}(4)$ has recently been identified as…

Combinatorics · Mathematics 2024-01-18 Nemanja Poznanovic , Cheryl E. Praeger

Given graphs $G, H$ and an integer $q \ge 2$, the generalized Ramsey number, denoted $r(G,H,q)$, is the minimum number of colours needed to edge-colour $G$ such that every copy of $H$ receives at least $q$ colours. In this paper, we prove…

Combinatorics · Mathematics 2024-06-06 Andrew Lane , Natasha Morrison

Let $\Gamma$ be a quiver on n vertices $v_1, v_2, ..., v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\alpha \in \N^n$. Hua gave a formula for $A_{\Gamma}(\alpha, q)$, the number of isomorphism classes of absolutely…

Representation Theory · Mathematics 2018-03-30 Geir T. Helleloid , Fernando Rodriguez Villegas

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

Combinatorics · Mathematics 2025-11-25 Harishchandra S. Ramane , B. Parvathalu , Daneshwari Patil , K. Ashoka

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…

Combinatorics · Mathematics 2025-07-01 Abdul Hameed , Mikhail Tyaglov

Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in…

Combinatorics · Mathematics 2024-06-06 Deepak Bal , Patrick Bennett , Emily Heath , Shira Zerbib

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

Combinatorics · Mathematics 2023-05-17 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…

Combinatorics · Mathematics 2019-06-14 C. Dalfó , M. A. Fiol

In 2018 the first, Rukavina and the third author constructed with the aid of a computer the first example of a strongly regular graph $\Gamma$ with parameters (216, 40, 4, 8) and proved that it is the unique PSU(4,2)-invariant…

Combinatorics · Mathematics 2019-07-31 Dean Crnković , Francesco Pavese , Andrea Švob

We investigate eigenvalues of the zero-divisor graph $\Gamma(R)$ of finite commutative rings $R$ and study the interplay between these eigenvalues, the ring-theoretic properties of $R$ and the graph-theoretic properties of $\Gamma(R)$. The…

Combinatorics · Mathematics 2019-10-29 Katja Mönius

For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $G$, then we say that $G$ is $k$-symmetric. In 1985, Faria showed that the multiplicity of Laplacian eigenvalue 1 is greater than or equal to…

Combinatorics · Mathematics 2022-11-22 Sunyo Moon , Hyungkee Yoo

We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger
‹ Prev 1 4 5 6 7 8 10 Next ›