Related papers: Quantum trees which maximize higher eigenvalues ar…

We consider the nonlinear eigenvalue problem, with Dirichlet boundary condition, for a class of very degenerate elliptic operators, with the aim to show that, at least for square type domains having fixed volume, the symmetry of the domain…

Let $M$ be a closed hypersurface in a noncompact rank-1 symmetric space $(\bar{\mathbb{M}}, ds^2)$ with $-4 \leq K_{\bar{\mathbb{M}}} \leq -1,$ or in a complete, simply connected Riemannian manifold $\mathbb{M}$ such that $0 \leq…

In this paper, we introduce the notion of the quadratic graph, that is a graph whose eigenvalues are integral or quadratic algebraic integral, and determine nine infinite families of quadratic starlike trees, which are just all the…

Motivated by classic tree algorithms, in 1995 we designed a bottom-up $O(n)$ algorithm to compute the determinant of a tree's adjacency matrix $A$. In 2010 an $O(n)$ algorithm was found for constructing a diagonal matrix congruent to $A +…

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…

The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and…

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

Inside a fixed bounded domain $\Omega$ of the plane, we look for the best compact connected set $K$, of given perimeter, in order to maximize the first Dirichlet eigenvalue $\lambda_1(\Omega\setminus K)$. We discuss some of the qualitative…

We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

We study the optimization of the positive principal eigenvalue of an indefinite weighted problem, associated with the Neumann Laplacian in a box $\Omega\subset\mathbb{R}^N$, which arises in the investigation of the survival threshold in…

Let $K$ be a simplicial complex, and let $\Delta_i^{up}(K)$ be the $i$-th up normalized Laplacian of $K$. Horak and Jost showed that the largest eigenvalue of $\Delta_i^{up}(K)$ is at most $i+2$, and characterized the equality case by the…

In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…

The purpose of the paper is to present quantitative estimates for the principal eigenvalue of discrete p-Laplacian on the set of rooted trees. Alternatively, it is studying the optimal constant of a class of weighted Hardy inequality. Three…

We discuss the design of interlayer edges in a multiplex network, under a limited budget, with the goal of improving its overall performance. We analyze the following three problems separately; first, we maximize the smallest nonzero…

Jakobson and Nadirashvili \cite{JN} constructed a sequence of eigenfunctions on $T^2$ with a bounded number of critical points, answering in the negative the question raised by Yau \cite{Yau1} which asks that whether the number of the…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. It is well known that for trees the Laplacian…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…