Eigenvalue bracketing for discrete and metric graphs

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using various types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the “exceptional” values of the metric graph corresponding to the Dirichlet spectrum) we carry over these estimates from the metric graph Laplacian to the discrete case. We apply the results to covering graphs and present examples where the covering graph Laplacians have spectral gaps.     

On the Spectral Gap of a Quantum Graph

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 combinatorial properties of the graph: its total length, diameter, number of vertices and number of edges. We investigate which combinations of parameters are necessary to obtain non-trivial upper and lower bounds and obtain a number of sharp estimates in terms of these parameters. We also show that, in contrast to the Laplacian matrix on a combinatorial graph, no bound depending only on the diameter is possible. As a special case of our results on metric graphs, we deduce estimates for the normalised Laplacian matrix on combinatorial graphs which, surprisingly, are sometimes sharper than the ones obtained by purely combinatorial methods in the graph theoretical literature.     

Essential spectrum of the weighted Laplacian on noncompact manifolds and applications

We obtain upper estimates for the bottom (that is, greatest lower bound) of the essential spectrum of weighted Laplacian operator of a noncompact weighted manifold under assumptions of the volume growth of their geodesic balls and spheres. Furthermore, we find examples where the equality occurs in the estimates obtained. As a consequence, we give estimates for the weighted mean curvature of complete noncompact hypersurfaces into weighted manifolds.     

Genericity of simple eigenvalues for a metric graph

We prove that, for a metric graph different from a polygon, the spectrum of the Laplacian is generically simple.     

Spectral Convergence of Quasi-One-Dimensional Spaces

We consider a family of non-compact manifolds X_ε (“graph-like manifolds”) approaching a metric graph X₀ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian and the generalized Neumann (Kirchhoff) Laplacian on the metric graph. In particular, we show the norm convergence of the resolvents, spectral projections and eigenfunctions. As a consequence, the essential and the discrete spectrum converge as well. Neither the manifolds nor the metric graph need to be compact, we only need some natural uniformity assumptions. We provide examples of manifolds having spectral gaps in the essential spectrum, discrete eigenvalues in the gaps or even manifolds approaching a fractal spectrum. The convergence results will be given in a completely abstract setting dealing with operators acting in different spaces, applicable also in other geometric situations. Communicated by Claude Alain Pillet Submitted: December 21, 2005 Accepted: January 30, 2006     

On the Laplacian spectrum of an infinite graph

In this paper, we introduce the notion of Laplacian spectrum of an infinite countable graph in a different way than in the papers by B. Mohar. We prove some basic properties of this type of spectrum. The approach used is in line with our approach to the limiting spectrum of an infinite graph. The technique of the Laplacian spectrum of finite graphs is essential in this approach.     

Eigenvalue Comparison Theorems of the Discrete Laplacians for a Graph

We give a graph theoretic analogue of Cheng's eigenvalue comparison theorems for the Laplacian of complete Riemannian manifolds. As its applications, we determine the infimum of the (essential) spectrum of the discrete Laplacian for infinite graphs.     

基于拉普拉斯谱确定的两类树

设图G是简单连通图.如果任何一个与图G关于拉普拉斯矩阵同谱的图,都与图G同构,称图G可由其拉普拉斯谱确定.定义了树Y_n和树F(2,n,1)两类特殊结构的树.利用同谱图线图的特点,证明了树Y_n和树F(2,n,1)可由其拉普拉斯谱确定.     

On Spectral Integral Variations of Graphs

Let G be a general graph. The spectrum S ( G ) of G is defined to be the spectrum of its Laplacian matrix. Let G + e be the graph obtained from G by adding an edge or a loop e . We study in this paper when the spectral variation between G and G + e is integral and obtain some equivalent conditions, through which a new Laplacian integral graph can be constructed from a known Laplacian integral graph by adding an edge.     

On Spectral Integral Variations of Graphs

Let G be a general graph. The spectrum S ( G ) of G is defined to be the spectrum of its Laplacian matrix. Let G + e be the graph obtained from G by adding an edge or a loop e . We study in this paper when the spectral variation between G and G + e is integral and obtain some equivalent conditions, through which a new Laplacian integral graph can be constructed from a known Laplacian integral graph by adding an edge.     

Spectral Analysis of Magnetic Laplacians on Conformally Cusp Manifolds

We consider an open manifold which is the interior of a compact manifold with boundary. Assuming gauge invariance, we classify magnetic fields with compact support into being trapping or non-trapping. We study spectral properties of the associated magnetic Laplacian for a class of Riemannian metrics which includes complete hyperbolic metrics of finite volume. When B is non-trapping, the magnetic Laplacian has nonempty essential spectrum. Using Mourre theory, we show the absence of singular continuous spectrum and the local finiteness of the point spectrum. When B is trapping, the spectrum is discrete and obeys the Weyl law. The existence of trapping magnetic fields with compact support depends on cohomological conditions, indicating a new and very strong long-range effect. In the non-gauge invariant case, we exhibit a strong Aharonov–Bohm effect. On hyperbolic surfaces with at least two cusps, we show that the magnetic Laplacian associated to every magnetic field with compact support has purely discrete spectrum for some choices of the vector potential, while other choices lead to a situation of limiting absorption principle. We also study perturbations of the metric. We show that in the Mourre theory it is not necessary to require a decay of the derivatives of the perturbation. This very singular perturbation is then brought closer to the perturbation of a potential. Submitted: February 6, 2007. Accepted: August 20, 2007.     

Absence of Absolutely Continuous Spectrum for the Kirchhoff Laplacian on Radial Trees

In this paper, we prove that the existence of absolutely continuous spectrum of the Kirchhoff Laplacian on a radial metric tree graph together with a finite complexity of the geometry of the tree implies that the tree is in fact eventually periodic. This complements the results by Breuer and Frank in (Rev Math Phys 21(7):929–945, 2009) in the discrete case as well as for sparse trees in the metric case.     

Riemannian Submersions with Discrete Spectrum

We prove some estimates on the spectrum of the Laplacian of the total space of a Riemannian submersion in terms of the spectrum of the Laplacian of the base and the geometry of the fibers. When the fibers of the submersions are compact and minimal, we prove that the spectrum of the Laplacian of the total space is discrete if and only if the spectrum of the Laplacian of the base is discrete. When the fibers are not minimal, we prove a discreteness criterion for the total space in terms of the relative growth of the mean curvature of the fibers and the mean curvature of the geodesic spheres in the base. We discuss in particular the case of warped products.     

The spectral characterization of graphs of index less than 2 with no path as a component

A graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency and Laplacian spectrum, respectively. It is known that connected graphs of index less than 2 are determined by their adjacency spectrum. In this paper, we focus on the problem of characterization of DS graphs of index less than 2. First, we give various infinite families of cospectral graphs with respect to the adjacency matrix. Subsequently, the results will be used to characterize all DS graphs (with respect to the adjacency matrix) of index less than 2 with no path as a component. Moreover, we show that most of these graphs are DS with respect to the Laplacian matrix.     

On the first eigenvalue of the mean finsler-laplacian

In this paper, we prove that several different definitions of the Finsler-Laplacian are equivalent. Then we prove that any Berwald metric is affinely equivalent to its mean metric and give some upper or lower bound estimates for the first eigenvalue of the mean Laplacian on Berwald manifolds, which generalize some results in Riemannian geometry.     

Theorems on partitioned matrices revisited and their applications to graph spectra

Some old results about spectra of partitioned matrices due to Goddard and Schneider or Haynsworth are re-proved. A new result is given for the spectrum of a block-stochastic matrix with the property that each off-diagonal block has equal entries and each diagonal block has equal diagonal entries and equal off-diagonal entries. The result is applied to the study of the spectra of the usual graph matrices by partitioning the vertex set of the graph according to the neighborhood equivalence relation. The concept of a reduced graph matrix is introduced. The question of when n-2 is the second largest signless Laplacian eigenvalue of a connected graph of order n is treated. A recent conjecture posed by Tam, Fan and Zhou on graphs that maximize the signless Laplacian spectral radius over all (not necessarily connected) graphs with given numbers of vertices and edges is refuted. The Laplacian spectrum of a (degree) maximal graph is reconsidered.     

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 the Laplacian spectral ratio of connected graphs

The Laplacian spectrum of a graph is the eigenvalues of the associated Laplacian matrix. The quotient between the largest and second smallest Laplacian eigenvalues of a connected graph, is called the Laplacian spectral ratio. Some bounds on the Laplacian spectral ratio are considered. We improve a relation on the Laplacian spectral ratio of regular graphs. Especially, the first two smallest Laplacian spectral ratios of graphs with given order are determined. And some operations on Laplacian spectral ratio are presented.     

含偶圈图的Laplacian 谱刻画

设 H(K_{1,5},P_n,C_l)是由路 P_n的两个悬挂点分别粘上星图K_{1,5}的悬挂点和圈 C_l的点所得的单圈图. 若两个二部图是关于Laplacian 矩阵同谱的, 则它们的线图是邻接同谱的, 两个邻接同谱图含有相同数目的同长闭回路. 如果任何一个与图G关于Laplacian 同谱图都与图G 同构, 那么称图G可由其Laplacian 谱确定. 利用图与线图之间的关系证明了H(K_{1,5},P_n,C_4)、H(K_{1,5},P_n,C_6) 由它们的Laplacian谱确定.