Some upper bounds for sums of eigenvalues of the Neumann Laplacian

Let be the th Neumann eigenvalue of a bounded domain with piecewisely smooth boundary in . In 1992, P. Kröger proved that , where the upper bound is sharp in view of Weyl's asymptotic formula. The aim of this paper is twofold. First, we will improve this estimate by multiplying a factor in terms of to its right-hand side which approaches strictly from below to 1 as tends to infinity. Second, we will generalize Kröger's estimate to the case when is a compact Euclidean submanifold.

     

Sharp lower bounds for the first eigenvalues of the bi-drifting Laplacian

In the present paper we study some kinds of the problems for the bi-drifting Laplacian operator and get some sharp lower bounds for the first eigenvalue for these eigenvalue problems on compact manifolds with boundary (also called a smooth metric measure space) and weighted Ricci curvature bounded inferiorly.     

A lower bound for eigenvalues of a clamped plate problem

In this paper, we study eigenvalues of a clamped plate problem. We obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine and Protter.     

Estimates for lower order eigenvalues of quadratic polynomials of the Laplacian

Extending the results of Cheng et al. [8], we study eigenvalues of lower order of quadratic polynomial of the Laplacian on a bounded domain in a complete Riemannian manifold and obtain sharp universal inequalities for them.     

A relation between the Laplacian and signless Laplacian eigenvalues of a graph

Let G be a graph of order n such that \(\sum_{i=0}^{n}(-1)^{i}a_{i}\lambda^{n-i}\) and \(\sum_{i=0}^{n}(-1)^{i}b_{i}\lambda^{n-i}\) are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that a _i ≥b _i for i=0,1,…,n. As a consequence, we prove that for any α, 0<α≤1, if q ₁,…,q _n and μ ₁,…,μ _n are the signless Laplacian and the Laplacian eigenvalues of G, respectively, then \(q_{1}^{\alpha}+\cdots+q_{n}^{\alpha}\geq\mu_{1}^{\alpha}+\cdots+\mu _{n}^{\alpha}\).     

A lower bound estimate for complete sums of characters of polynomials and rational functions

In this paper we shall study the complete Dirichlet character sums involved with some polynomials and rational functions whichare useful to the Waring's problem.     

Trace formulae for the eigenvalues of the Laplacian

Summary The trace function where { _m} _m=1 are the eigenvalues of the Laplacian is studied for a variety of domains. The dependence of(t) on the connectivity of a domain and the boundary conditions is analysed. Particular attention is given to annular domains.

---

Résumé Pour divers domaines, on étudie la fonction trace , où ₁, ₂, ₃, sont les valeurs propres du laplacien. On analyse comment(t) dépend du domaine et des conditions aux limites. On considère notamment le cas de couronnes circulaires.

     

A note on the signless Laplacian eigenvalues of graphs

In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue inequalities. We first consider an interlacing theorem when a vertex is deleted. In particular, let G-v be a graph obtained from graph G by deleting its vertex v and κ_i(G) be the ith largest eigenvalue of the signless Laplacian of G, we show that κ_i+1(G)-1?κ_i(G-v)?κ_i(G). Next, we consider the third largest eigenvalue κ₃(G) and we give a lower bound in terms of the third largest degree d₃ of the graph G. In particular, we prove that . Furthermore, we show that in several situations the latter bound can be increased to d₃-1.     

On upper bounds for Laplacian graph eigenvalues

In this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalue λ(G):

     

On the multiplicity of Laplacian eigenvalues for unicyclic graphs

Let G be a connected graph of order n and U a unicyclic graph with the same order. We firstly give a sharp bound for m_G(μ), the multiplicity of a Laplacian eigenvalue μ of G. As a straightforward result, m_U(1) ? n ? 2. We then provide two graph operations (i.e., grafting and shifting) on graph G for which the value of m_G(1) is nondecreasing. As applications, we get the distribution of m_U (1) for unicyclic graphs on n vertices. Moreover, for the two largest possible values of m_U(1) ∈ {n ? 5, n ? 3}, the corresponding graphs U are completely determined.

     

Lower bounds of the Laplacian graph eigenvalues

In this paper we prove that all positive eigenvalues of the Laplacian of an arbitrary simple graph have some positive lower bounds. For a fixed integer k 1 we call a graph without isolated vertices k-minimal if its kth greatest Laplacian eigenvalue reaches this lower bound. We describe all 1-minimal and 2-minimal graphs and we prove that for every k 3 the path P_k+1 on k + 1 vertices is the unique k-minimal graph.     

Laplacian eigenvalues and the maximum cut problem

We introduce and study an eigenvalue upper bound(G) on the maximum cut mc (G) of a weighted graph. The function(G) has several interesting properties that resemble the behaviour of mc (G). The following results are presented.We show that is subadditive with respect to amalgam, and additive with respect to disjoint sum and 1-sum. We prove that(G) is never worse that 1.131 mc(G) for a planar, or more generally, a weakly bipartite graph with nonnegative edge weights. We give a dual characterization of(G), and show that(G) is computable in polynomial time with an arbitrary precision.The research has been partially done when the second author visited LRI in September 1989.     

Upper bounds for the sum of Laplacian eigenvalues of graphs

Let G be a graph with n vertices and $e(G)$ edges, and let ${\mu }_1(G)?{\mu }_2(G)???{\mu }_n(G)=0$ be the Laplacian eigenvalues of G. Let $S_k(G)={\sum }_{i=1}^k{\mu }_i(G)$, where $1?k?n$. Brouwer conjectured that $S_k(G)?e(G)+\left(\genfrac{}{}{0ex}{}{k+1}{2}\right)$ for $1?k?n$. It has been shown in Haemers et al. [7] that the conjecture is true for trees. We give upper bounds for $S_k(G)$, and in particular, we show that the conjecture is true for unicyclic and bicyclic graphs.