Related papers: Most Laplacian eigenvalues of a tree are small

It is well known that the standard flat torus $\mathbb{T}^2=\mathbb{R}^2/\Z^2$ has arbitrarily large Laplacian-eigenvalue multiplicities. We prove, however, that $24$ is the optimal upper bound for the multiplicities of the nonzero…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

It is proven following [18[ that Laplacians with standard vertex continuous on metric trees and with standard and Dirichlet conditions on arbitrary metric graphs possess an infinite sequence of simple eigenvalues with the eigenfunctions not…

This paper is concerned with the lower bounds for the principal frequency of the $p$-Laplacian on $n$-dimensional Euclidean domains. In particular, we extend the classical results involving the inner radius of a domain and the first…

Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the…

Let $G$ be a connected simple graph on $n$ vertices. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\rho_{n-1}(G)$ be the second least eigenvalue of $\mathcal{L}(G)$. Denote by $\nu(G)$ the independence number of $G$.…

The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…

We consider the Dirichlet eigenvalues of the fractional Laplacian $(-\Delta)^s$, with $s\in (0,1)$, related to a smooth bounded domain $\Omega$. We prove that there exists an arbitrarily small perturbation $\tilde\Omega=(I+\psi)(\Omega)$ of…

We propose the following conjecture: For every fixed $\alpha\in [0,\frac 13)$, each graph of minimum degree at least $(1+\alpha)\frac k2$ and maximum degree at least $2(1-\alpha)k$ contains each tree with $k$ edges as a subgraph. Our main…

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…

We prove various estimates for the first eigenvalue of the magnetic Dirichlet Laplacian on a bounded domain in two dimensions. When the magnetic field is constant, we give lower and upper bounds in terms of geometric quantities of the…

We introduce a parameterized family of Poisson transforms on trees of bounded degree, construct explicit inverses for generic parameters, and characterize moderate growth of Laplace eigenfunctions by H\"older regularity of their boundary…

We prove that Klein quartic maximizes the multiplicity of the first positive eigenvalue of the Laplacian among all closed hyperbolic surfaces of genus $3$, with multiplicity equal to $8$. We also obtain partial results in genus $2$, where…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

We study eigenvalues and eigenfunctions of the Laplacian on the surfaces of four of the regular polyhedrons: tetrahedron, octahedron, icosahedron and cube. We show two types of eigenfunctions: nonsingular ones that are smooth at vertices,…

The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes. The maximum of l(G) on…

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…

Denote the Laplacian of a graph $G$ by $L(G)$ and its second smallest Laplacian eigenvalue by $\lambda_2(G)$. If $G$ is a graph on $n\ge 2$ vertices, then it is shown that the second smallest eigenvalue of $L(G) + \frac{1}{n}…

We add a divergence-free drift with increasing magnitude to the fractional Laplacian on a bounded smooth domain, and discuss the behavior of the principal eigenvalue for the Dirichlet problem. The eigenvalue remains bounded if and only if…