𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Pure Point Spectrum for the Laplacian on
✍ Christophe Sabot πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 208 KB

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

On the Laplacian Spectrum of (Ξ±, Ο‰) -Gra
✍ Alexander Kelmans πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 111 KB

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 (Ξ±, Ο‰

On the conjecture for certain Laplacian
✍ Kinkar Ch. Das; Sang-Gu Lee; Gi-Sang Cheon πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 184 KB πŸ‘ 1 views

## 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

What Is Not in the Domain of the Laplaci
✍ Oren Ben-Bassat; Robert S Strichartz; Alexander Teplyaev πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 223 KB

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

On the chromatic spectrum of acyclic dec
✍ Robert E. Jamison; Eric Mendelsohn πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## 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