Related papers: Spectral properties of generalized Paley graphs
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…
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$…
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…
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…
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…
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…
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…
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,…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…