Determinants of Laplacians on graphs
โ Scribed by Robin Forman
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 751 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0040-9383
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
## Abstract In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set __S~i,n~__ to be the set of all integers from 0 to __n__, excluding __i__. If there exists a graph whose Laplacian matrix has this set as its eigenvalues
Kigami has defined an analog of the Laplacian on a class of self-similar fractals, including the familiar Sierpinski gasket. We study properties of this operator. We show that there is a maximal principle for solutions of certain nonlinear equations of the form 2u(x)=F(x, u(x)). We discuss the exten