Laplacian Eigenvectors of Graphs
Perron-Frobenius and Faber-Krahn Type Theorems
(Sprache: Englisch)
This fascinating volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, and graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
42.79 €
21 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Laplacian Eigenvectors of Graphs “
This fascinating volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, and graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology. Eigenvectors of graph Laplacians may seem a surprising topic for a book, but the authors show that there are subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs.
Klappentext zu „Laplacian Eigenvectors of Graphs “
This fascinating volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, and graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology. Eigenvectors of graph Laplacians may seem a surprising topic for a book, but the authors show that there are subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs.
Inhaltsverzeichnis zu „Laplacian Eigenvectors of Graphs “
Graph Laplacians.- Eigenfunctions and Nodal Domains.- Nodal Domain Theorems for Special Graph Classes.- Computational Experiments.- Faber-Krahn Type Inequalities.
Bibliographische Angaben
- Autoren: Türker Biyikoglu , Josef Leydold , Peter F. Stadler
- 2007, VIII, 120 Seiten, mit zahlreichen Abbildungen, Maße: 15,4 x 23,8 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3540735097
- ISBN-13: 9783540735090
- Erscheinungsdatum: 26.07.2007
Sprache:
Englisch
Rezension zu „Laplacian Eigenvectors of Graphs “
From the reviews: "This is an interesting ... book about a very specialized topic in spectral graph theory, namely the eigenvectors of the (generalized) Laplacian matrices of graphs. ... Overall I found the book well worth reading, with a clear and novel presentation of some interesting ideas." (Gordon F. Royle, Mathematical Reviews, Issue 2009 a) "The present book covers a narrow topic on the border of graph theory, geometry and analysis. ... The intended readership is broad. ... The presentation is ... clear. It is certainly stimulating and well worth to read for graduate students or researchers who encounter eigenvectors connected to discrete or continuous/geometrical structures." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 75, 2009)
Pressezitat
From the reviews: "This is an interesting ... book about a very specialized topic in spectral graph theory, namely the eigenvectors of the (generalized) Laplacian matrices of graphs. ... Overall I found the book well worth reading, with a clear and novel presentation of some interesting ideas." (Gordon F. Royle, Mathematical Reviews, Issue 2009 a)
"The present book covers a narrow topic on the border of graph theory, geometry and analysis. ... The intended readership is broad. ... The presentation is ... clear. It is certainly stimulating and well worth to read for graduate students or researchers who encounter eigenvectors connected to discrete or continuous/geometrical structures." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 75, 2009)
Kommentar zu "Laplacian Eigenvectors of Graphs"
0 Gebrauchte Artikel zu „Laplacian Eigenvectors of Graphs“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Laplacian Eigenvectors of Graphs".
Kommentar verfassen