Abstract. We give an upper bound for the infimum of the essential spectrum of the combinatorial Laplacian on an infinite graph in terms of the exponential growth of the graph.
References (9)
Related articles (0)
Figures (0)
Content from these authors
Supplementary material (0)
Result List ()
Cited by
This article cannot obtain the latest cited-by information.
