Related papers: Estimates of the first Dirichlet eigenvalue of gra…

Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] defined the matrix Aalpha(G), as a convex combination of A(G) and D(G), the following way, Aalpha(G) = alpha A(G) + (1 - alpha)D(G), where…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We establish lower bound for the first nonzero eigenvalue of the Laplacian on a closed K\"ahler manifold in terms of dimension, diameter, and lower bounds of holomorphic sectional curvature and orthogonal Ricci curvature. On compact…

We establish a lower bound for the principal $p-$frequency $\lambda_{1,p}(\Omega)$ on a bounded domain $\Omega$ in a non-compact Riemannian manifold of dimension $n.$ Under the assumption that the Ricci curvature satisfies…

Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r+1}$-free graph on at least $r+1$ vertices and $m$ edges, then $\lambda^2_1(G)+\lambda^2_2(G)\leq \frac{r-1}{r}\cdot2m$,…

In this paper, we consider the optimization problem for the first Dirichlet eigenvalue $\lambda_1(\Omega)$ of the $p$-Laplacian $\Delta_p$, $1< p< \infty$, over a family of doubly connected planar domains $\Omega= B \setminus \overline{P}$,…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

In this work, we obtain estimates for the upper bound of gaps between consecutive eigenvalues for the eigenvalue problem of a class of second-order elliptic differential operators in divergent form, with Dirichlet boundary conditions, in a…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

The Faber-Krahn inequality states that the first Dirichlet eigenvalue among all bounded domains is no less than a Euclidean ball with the same volume in $\mathbb{R}^n$ \cite{Chavel FB}. B{\i}y{\i}ko\u{g}lu and Leydold (J. Comb. Theory, Ser.…

Let $G=(V,E)$ be a locally finite graph, $\Omega\subset V$ be a bounded domain, $\Delta$ be the usual graph Laplacian, and $\lambda_1(\Omega)$ be the first eigenvalue of $-\Delta$ with respect to Dirichlet boundary condition. Using the…

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

The well-known Faber-Krahn theorem states that the ball has the lowest first Dirichlet eigenvalue among all domains of the same volume in $\mathbb{R}^n$. Leydold (Geom. Funct. Anal, 1997) gave the discrete version of Faber-Krahn inequality…

We show that for every prime $d$ and $\alpha\in (0,1/6)$, there is an infinite sequence of $(d+1)$-regular graphs $G=(V,E)$ with girth at least $2\alpha \log_{d}(|V|)(1-o_d(1))$, second adjacency matrix eigenvalue bounded by…

In this paper, we provide the lower bounds of the first non-zero basic eigenvalue on a closed singular Riemannian manifold $(M,\mathcal{F})$ with basic mean curvature that depends on the given non-negative lower bound of the Ricci curvature…

In this paper we study the Dirichlet eigenvalue problem $$ -\Delta_p u-\Delta_{J,p}u =\lambda|u|^{p-2}u \quad \text{ in } \Omega,\quad u=0 \quad\text{ in } \Omega^c=\mathbb{R}^N\setminus\Omega. $$ Here $\Delta_p u$ is the standard local…

It is a well-known fact that a graph of diameter $d$ has at least $d+1$ eigenvalues. Let us call a graph \emph{$d$-extremal} if it has diameter $d$ and exactly $d+1$ eigenvalues. Such graphs have been intensively studied by various authors.…

The main result of this paper is a sharp upper bound on the first positive eigenvalue of Dirac operators in two dimensional simply connected $C^3$-domains with infinite mass boundary conditions. This bound is given in terms of a conformal…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…