Non-bipartiteness of Graphs and the Upper Bounds of Dirichlet Forms
- 33 Downloads
The sum of the lower bound and the upper one of the spectrum of our discrete Laplacian is less than or equal to 2. The equality holds if a graph is bipartite while the converse does not hold for general infinite graphs. In this paper, we give an estimate of the upper bounds of Dirichlet forms and using this estimate together with an h-transform, we show that the sum is strictly less than 2 for a certain class of infinite graphs.
Mathematics Subject Classifications (2000)Primary 47B39, 58J50 Secondary 05C75
Key wordsdiscrete Laplacian Dirichlet form bipartiteness h-transform
Unable to display preview. Download preview PDF.
- 1.Bollobás, B.: Modern Graph Theory. Springer, Berlin Heidelberg New York (1998)Google Scholar
- 4.Kato, T.: Perturbation Theory for Linear operators, Corrected Printing of the 2nd edn. Springer, Berlin Heidelberg New York (1980)Google Scholar
- 7.Woess, W.: Random Walks on Infinite Graphs and Groups, Cambridge Tracts in Math. 138. Cambridge University Press (2000)Google Scholar