Related papers: Eigenvalues of Maximal Abelian Covers

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

If G is a finite graph, then the largest eigenvalue L of the adjacency matrix of G is a totally real algebraic integer (L is the Perron-Frobenius eigenvalue of G). We say that G is abelian if the field generated by L^2 is abelian. Given a…

From a resolution graph with certain conditions, Neumann and Wahl constructed an equisingular family of surface singularities called splice quotients. For this class some fundamental analytic invariants have been computed from their…

Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana Theorem to hypergraphs.

A very well-covered graph is an unmixed graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. We study these graphs by means of Betti splittings and mapping cone constructions. We show…

In 1995, Nadirashvili and subsequently Ashbaugh and Benguria proved the Rayleigh Conjecture concerning the first eigenvalue of the bilaplacian with clamped boundary conditions in dimension $2$ and $3$. Since then, the conjecture has…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

We find sharp upper bounds for the multiplicities and the numerical values of all the distinct eigenvalues on a surface of revolution diffeomorphic to the sphere.

Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…

We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

A subgraph $H$ of a multigraph $G$ is overfull if $ |E(H) | > \Delta(G) \lfloor |V(H)|/2 \rfloor$. Analogous to the Overfull Conjecture proposed by Chetwynd and Hilton in 1986, Stiebitz et al. in 2012 formed the multigraph version of the…

Let $X$ be a compact connected orientable hyperbolic surface and let $X_n$ be a degree $n$ random cover. We show that, with high probability, the distribution of eigenvalues of the Laplacian on $X_n$ converges to the spectral measure of the…

We consider the signless $p$-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case $p=2$). We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds…

Sharp upper bounds for the first eigenvalue of the Laplacian on a surface of a fixed area are known only in genera zero and one. We investigate the genus two case and conjecture that the first eigenvalue is maximized on a singular surface…

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…

Let $G=(V,E)$ be a connected finite graph. We study a system of non-Abelian multiple vortex equations on $G$. We established a necessary and sufficient condition for the existence and uniqueness of solutions to the non-Abelian multiple…

It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality…