The Laplacian spread of unicyclic graphs

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. In a recent work the trees with maximal Laplacian spread and with minimal Laplacian spread among all trees of fixed order are separately determined. In this work, we characterize the unique unicyclic graph with maximal Laplacian spread among all connected unicyclic graphs of fixed order.     

双圈图的无符号拉普拉斯谱半径和谱展

The signless Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the smallest eigenvalue of its signless Laplacian matrix. In this paper, we determine the first to llth largest signless Laplacian spectral radii in the class of bicyclic graphs with n vertices. Moreover, the unique bicyclic graph with the largest or the second largest signless Laplacian spread among the class of connected bicyclic graphs of order n is determined, respectively.     

双圈图的Laplace谱跨度

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In our recent work, we have determined the graphs with maximal Laplacian spreads among all trees of fixed order and among all unicyclic graphs of fixed order, respectively. In this paper, we continue the work on Laplacian spread of graphs, and prove that there exist exactly two bicyclic graphs with maximal Laplacian spread among all bicyclic graphs of fixed order, which are obtained from a star by adding two incident edges and by adding two nonincident edges between the pendant vertices of the star, respectively.     

The Laplacian spread of quasi-tree graphs

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. Bao, Tan and Fan [Y.H. Bao, Y.Y. Tan,Y.Z. Fan, The Laplacian spread of unicyclic graphs, Appl. Math. Lett. 22 (2009) 1011-1015.] characterize the unique unicyclic graph with maximum Laplacian spread among all connected unicyclic graphs of fixed order. In this paper, we characterize the unique quasi-tree graph with maximum Laplacian spread among all quasi-tree graphs in the set Q(n,d) with .     

Some results on the Laplacian eigenvalues of unicyclic graphs

In this paper, we provide the smallest value of the second largest Laplacian eigenvalue for any unicyclic graph, and find the unicyclic graphs attaining that value. And also give an “asymptotically good” upper bounds for the second largest Laplacian eigenvalues of unicyclic graphs. Using this results, we can determine unicyclic graphs with maximum Laplacian separator. And unicyclic graphs with maximum Laplacian spread will also be determined.     

On the second largest Laplacian eigenvalues of graphs

The second largest Laplacian eigenvalue of a graph is the second largest eigenvalue of the associated Laplacian matrix. In this paper, we study extremal graphs for the extremal values of the second largest Laplacian eigenvalue and the Laplacian separator of a connected graph, respectively. All simple connected graphs with second largest Laplacian eigenvalue at most 3 are characterized. It is also shown that graphs with second largest Laplacian eigenvalue at most 3 are determined by their Laplacian spectrum. Moreover, the graphs with maximum and the second maximum Laplacian separators among all connected graphs are determined.     

On nonequivalence of regular boundary points for second-order elliptic operators

In this paper, we present examples of nondivergence form of second-order elliptic operators with continuous coefficients, such that L has an irregular boundary point that is regular for the Laplacian. Also for any eigenvalue spread <1 of the matrix of the coefficients, we provide an example of operator with discontinuous coefficients that has regular boundary points nonequivalent to Laplacian’s (we give examples for each direction of nonequivalence). All examples are constructed for each dimension starting with 3.     

The smallest eigenvalue of the signless Laplacian

Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied. The present paper surveys the known results and presents some new ones about the smallest eigenvalue of the signless Laplacian.     

On the Laplacian Eigenvalues of Signed Graphs

A signed graph is a graph with a sign attached to each edge. This article extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the largest Laplacian eigenvalue of a signed graph is investigated, which generalizes the corresponding results on the largest Laplacian eigenvalue of a graph.     

Riemannian Foliations and Eigenvalue Comparison

Eigenvalue comparison theorems for the Laplacian on a Riemannian manifold generally give bounds for the first Dirichlet eigenvalue on balls in the manifold in terms of an eigenvalue arising from a geometrically or analytically simpler situation. Cheng's eigenvalue comparison theory assumes bounds on the curvature of the manifold and then compares this eigenvalue to the eigenvalue of a ball in a constant curvature space form. In this paper we examine the basic Laplacian – the appropriate Laplacian on functions that are constant on the leaves of the foliation. The main theorems generalize Cheng's eigenvalue comparison theorem and other eigenvalue comparison theorems to the category of Riemannian foliations by estimating the first Dirichlet eigenvalue for the basic Laplacian on a metric tubular neighborhood of a leaf closure. Several other facts about the the first eigenvalue of such foliated tubes as well as some needed facts about the tubes themselves are established. This comparison theory, like Cheng's theorem, remains valid for large tubes that are not homotopic to the middle leaf closure and that may have irregular boundaries. We apply these results to obtain upper bounds for the eigenvalues of the basic Laplacian on a closed manifold in terms of curvature bounds and the transverse diameter of the foliation.     

图的Laplacian特征值

本文研究了连通图的Laplacian特征值,利用图的Laplacian矩阵的特征多项式的行列式表示式,对存在两个不同顶点,但有相同邻集的一类图,得到了一个Laplacian特征值,并给出了它的应用.     

Non-bipartite Graphs with Third Largest Laplacian Eigenvalue Less Than Three

All bipartite graphs whose third largest Laplacian eigenvalue is less than 3 have been characterized by Zhang. In this paper, all connected non-bipartite graphs with third largest Laplacian eigenvalue less than three are determined.     

围长为g且有k个悬挂点的单圈图的谱半径和Laplacian谱半径

图的谱半径和Laplacian谱半径分别是图的邻接矩阵和Laplacian矩阵的最大特征值.本文中,我们分别刻画了围长为g且有k个悬挂点的单圈图的谱半径和Laplacian谱半径达到最大时的极图.     

Riemann流形上Laplace算子第一特征值的一点注记

本文研究了黎曼流形上Laplace算子的第一特征值,利用流形的测地球上的Sobolev常数进行讨论并进行Moser迭代,得到闭的黎曼流形上Laplace算子第一特征值的一个下界估计.     

Laplacian第一特征值整体曲率Pinching的一个结果

紧致流形上Laplacian的第一特征值的下界估计一直以来是人们非常感兴趣的问题之一.本文在整体曲率Pinching较小的条件之下考虑这个问题,得到了相应几何条件之下的Laplacian第一特征值的一个下界估计.     

On the Eigenvalue Two and Matching Number of a Tree

In [6],Guo and Tan have shown that 2 is a Laplacian eigenvalue of any tree with perfect matchings.For trees without perfect matchings,we study whether 2 is one of its Laplacian eigenvalues.If the matchingnumber is 1 or 2,the answer is negative;otherwise,there exists a tree with that matching number which has (hasnot) the eigenvalue 2.In particular,we determine all trees with matching number 3 which has the eigenvalue2.     

The Problem of Eigenvalue on Noncompact Complete Riemannian Manifold

Let M be an n-dimensional noncompact complete Riemannian manifold, "Δ" is the Laplacian of M. It is a negative selfadjoint operator in L²(M). First, we give a criterion of non-existence of eigenvalue by the heat kernel. Applying the criterion yields that the Laplacian on noncompact constant curvature space form has no eigenvalue. Then, we give a geometric condition of M under which the Laplacian of M has eigenvalues. It implies that changing the metric on a compact domain of constant negative curvature space form may yield eigenvalues.     

Extension of Reilly formula with applications to eigenvalue estimates for drifting Laplacians

In this Note, we extend the Reilly formula for drifting Laplacian operator and apply it to study eigenvalue estimate for drifting Laplacian operators on compact Riemannian manifolds' boundary. Our results on eigenvalue estimates extend previous results of Reilly and Choi and Wang.     

The Laplacian spread of graphs

The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected c-cyclic graphs with n vertices and Laplacian spread n − 1 are discussed.