首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Eigenvalue Comparison Theorems of the Discrete Laplacians for a Graph
Authors:Hajime Urakawa
Institution:(1) Mathematics Laboratories, Graduate School of Information Sciences, Tohoku University, Katahira 2-1-1, Sendai, 980-8577, Japan
Abstract: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.
Keywords:first eigenvalue  Laplacian  infinite graph  degree
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号