We prove for the class of nested fractals introduced by T. Lindstro% m (1990, Memoirs Amer. Math. Soc. 420) that the integrated density of states is completely created by the so-called Neuman Dirichlet eigenvalues. The corresponding eigenfunctions lead to eigenfunctions with compact support on the u
Pure Point Spectrum of the Laplacians on Fractal Graphs
β Scribed by L. Malozemov; A. Teplyaev
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 514 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We study the Laplacian spectrum of (Ξ±, Ο)-graphs which play an important role in the theory of perfect graphs. The properties of the spectrum we found allow the establishment of some structural properties of (Ξ±, Ο)-graphs. We describe, in particular, a class of graphs that are not subgraphs of (Ξ±, Ο
## Abstract Let __G__ be a simple graph of order __n__ with Laplacian spectrum {Ξ»~__n__~, Ξ»~__n__β1~, β¦, Ξ»~1~} where 0=Ξ»~__n__~β€Ξ»~__n__β1~β€β β€Ξ»~1~. If there exists a graph whose Laplacian spectrum is __S__={0, 1, β¦, __n__β1}, then we say that __S__ is Laplacian realizable. In 6, Fallat et al. posed
We consider the analog of the Laplacian on the Sierpinski gasket and related fractals, constructed by Kigami. A function f is said to belong to the domain of 2 if f is continuous and 2f is defined as a continuous function. We show that if f is a nonconstant function in the domain of 2, then f 2 is n
## Abstract If __G__ is any graph, a __Gβdecomposition__ of a __host__ graph __H__β=β(__V__, __E__) is a partition of the edge set of __H__ into subgraphs of __H__ which are isomorphic to __G__. The __chromatic index__ of a __G__βdecomposition is the minimum number of colors required to color the p