Related papers: Quantum trees which maximize higher eigenvalues ar…

This paper reviews many of the known inequalities for the eigenvalues of the Laplacian and bi-Laplacian on bounded domains in Euclidean space. In particular, we focus on isoperimetric inequalities for the low eigenvalues of the Dirichlet…

In this paper, we investigate a shape optimization problem for the second Robin eigenvalue of the weighted Laplacian on bounded Lipschitz domains symmetric about the origin. Our main theorem states that the ball centered at the origin…

In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly…

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

In this note, we present a structural description of certain connected cographs having $k \geq 2$ main signless Laplacian eigenvalues. This result allows us to characterize the cographs which are quasi-threshold graphs with two main…

Let $G$ be a $k$-uniform hypergraph with vertex set $V(G)$ and edge set $E(G)$. A connected and acyclic hypergraph is called a supertree. For $0\leq\alpha<1$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha…

In this paper we prove the existence of an optimal set for the minimization of the $k$-th variational eigenvalue of the $p$-Laplacian among $p$-quasi open sets of fixed measure included in a box of finite measure. An analogous existence…

From Alon and Boppana, and Serre, we know that for any given integer $k\geq 3$ and real number $\lambda<2\sqrt{k-1}$, there are finitely many $k$-regular graphs whose second largest eigenvalue is at most $\lambda$. In this paper, we…

We consider the problem of minimising the $k$th eigenvalue, $k \geq 2$, of the ($p$-)Laplacian with Robin boundary conditions with respect to all domains in $\mathbb{R}^N$ of given volume $M$. When $k=2$, we prove that the second eigenvalue…

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…

This work presents conjectures about eigenvalues of matrices associated with $k$-path graphs, the algebraic connectivity, defined as the second smallest eigenvalue of the Laplacian matrix, and the $\alpha$-index, as the largest eigenvalue…

It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge…

We study the problem of optimizing the eigenvalues of the Dirichlet Laplace operator under perimeter constraint. We prove that optimal sets are analytic outside a closed singular set of dimension at most $d-8$ by writing a general…

Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…

In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…

If $G$ is a graph and $\mathbf{m}$ is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph $G$, what can we say about the eigenvalues of all such realizing matrices for $\mathbf{m}$? It has sometimes…

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 develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…

We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the…