Related papers: Eigenvalues of Maximal Abelian Covers
In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…
Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…
We prove sharp criteria on the behavior of radial curvature for the existence of asymptotically flat or hyperbolic Riemannian manifolds with prescribed sets of eigenvalues embedded in the spectrum of the Laplacian. In particular, we…
We study the nodal count of the so-called bi-dendral graphs and show that it exhibits an anomaly: the nodal surplus is never equal to 0 or $\beta$, the first Betti number of the graph. According to the nodal-magnetic theorem, this means…
In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
The Hermitian eigenvalue problem asks for the possible eigenvalues of a sum of Hermitian matrices given the eigenvalues of the summands. This is a problem about the Lie algebra of the maximal compact subgroup of $G=\operatorname{SL}(n)$ .…
A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…
For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…
Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order $(r+1)$ the $r$-partite Turan graph has maximal spectral radius.
This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…
In this paper, we investigate the first eigenvalues of two closed eigenvalue problems of the bi-Beltrami-Laplacian on minimal embedded isoparametric hypersurface in the unit sphere $\mathbb{S}^{n+1}(1)$. Although many mathematicians want to…
In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…
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…
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…
As a natural generalization of line graphs, Hoffman line graphs were defined by Woo and Neumaier. Especially, Hoffman line graphs are closely related to the smallest eigenvalue of graphs, and the uniqueness of strict covers of a Hoffman…
We define the cover number of a graph $G$ by a graph class $\mathcal P$ as the minimum number of graphs of class $\mathcal P$ required to cover the edge set of $G$. Taking inspiration from a paper by Harary, Hsu and Miller, we find an exact…
The Hermitian eigenvalue problem asks for the possible eigenvalues of a sum of $n\times n$ Hermitian matrices, given the eigenvalues of the summands. The regular faces of the cones $\Gamma_n(s)$ controlling this problem have been…
We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…
We describe the eigenvalues and the eigenspaces of the adjacency matrices of subgraphs of the Hamming cube induced by Hamming balls, and more generally, by a union of adjacent concentric Hamming spheres. As a corollary, we extend the range…