Related papers: An upper bound for higher order eigenvalues of sym…

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…

In this work we study the homogenization for eigenvalues of the fractional $p-$Laplace in a bounded domain both with Dirichlet and Neumann conditions. We obtain the convergence of eigenvalues and the explicit order of the convergence rates.

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

In this paper we will prove new extrinsic upper bounds for the eigenvalues of the Dirac operator on an isometrically immersed surface $M^2 \hookrightarrow {\Bbb R}^3$ as well as intrinsic bounds for 2-dimensional compact manifolds of genus…

Let $\Omega$ be a bounded, smooth domain of $\mathbb R^N$, $N\ge 2$. In this paper, we prove some inequalities involving the first Robin eigenvalue of the $p$-laplacian operator. In particular, we prove an upper bound for the first Robin…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

The Laplace operator admits infinite self-adjoint extensions when considered on a segment of the real line. They have different domains of essential self-adjointness characterized by a suitable set of boundary conditions on the wave…

Let $b(k,\ell,\theta)$ be the maximum number of vertices of valency $k$ in a $(k,\ell)$-semiregular bipartite graph with second largest eigenvalue $\theta$. We obtain an upper bound for $b(k,\ell,\theta)$ for $0 < \theta < \sqrt{k-1} +…

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…

Let $\lambda_{2}(G)$ be the second smallest normalized Laplacian eigenvalue of a graph $G$. In this paper, we determine all unicyclic graphs of order $n\geq21$ with $\lambda_{2}(G)\geq 1-\frac{\sqrt{6}}{3}$. Moreover, the unicyclic graphs…

In this article, we obtain some results in the direction of ``infinite dimensional symplectic spectral theory". We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators.…

The aim of this paper is to obtain new inequalities for a large family of generalizations of the Wiener Index and to characterize the set of extremal graphs with respect to them. Our main results provide upper and lower bounds for these…

We describe a highly efficient numerical scheme for finding two-sided bounds for the eigenvalues of the fractional Laplace operator (-Delta)^{alpha/2} in the unit ball D in R^d, with a Dirichlet condition in the complement of D. The…

Let $G$ be a graph on $n \ge 3$ vertices, whose adjacency matrix has eigenvalues $\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n$. The problem of bounding $\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov,…

By the calculation of the gap of the consecutive eigenvalues of $\Bbb S^n$ with standard metric, using the Weyl's asymptotic formula, we know the order of the upper bound of this gap is $k^{\frac{1}{n}}.$ We conjecture that this order is…

For a simple connected graph $ G $ of order $ n $, the normalized Laplacian is a square matrix of order $ n $, defined as $\mathcal{L}(G)= D(G)^{-\frac{1}{2}}L(G)D(G)^{-\frac{1}{2}}$, where $ D(G)^{-\frac{1}{2}} $ is the diagonal matrix…