AbstractIn this paper we study the spectral structure of the discrete Laplacian on an infinite graph. We show that, for a finite graph including a certain kind of a family of cycles, the spectrum of the Laplacian on its homology universal covering graph has band structure and no eigenvalues; furthermore it is purely absolutely continuous. Interesting examples that illustrate our theorems are also exhibited
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
AbstractLet G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees an...
There are a lot of researches on the spectrum of the discrete Laplacian on an infinite graph in vari...
AbstractWe develop eigenvalue estimates for the Laplacians on discrete and metric graphs using vario...
28 pages, 6 figures.-- MSC2000 codes: 05C50, 05C70, 47A10.-- ArXiv pre-print available at: http://ar...
Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractA necessary condition for the existence of long cycles in a graph involving the Laplacian sp...
AbstractFor discrete magnetic Schrödinger operators on covering graphs of a finite graph, we investi...
A one-by-one exhaustion is a combinatorial/geometric condition which excludes eigenvalues from the s...
For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $...
AbstractThe spectrum of a locally finite countable graph is defined. Some theorems known from the th...
AbstractWe show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenval...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
AbstractLet G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees an...
There are a lot of researches on the spectrum of the discrete Laplacian on an infinite graph in vari...
AbstractWe develop eigenvalue estimates for the Laplacians on discrete and metric graphs using vario...
28 pages, 6 figures.-- MSC2000 codes: 05C50, 05C70, 47A10.-- ArXiv pre-print available at: http://ar...
Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractA necessary condition for the existence of long cycles in a graph involving the Laplacian sp...
AbstractFor discrete magnetic Schrödinger operators on covering graphs of a finite graph, we investi...
A one-by-one exhaustion is a combinatorial/geometric condition which excludes eigenvalues from the s...
For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $...
AbstractThe spectrum of a locally finite countable graph is defined. Some theorems known from the th...
AbstractWe show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenval...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
AbstractLet G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees an...