Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems

Author(s)

• Bıyıkoğlu, Türker
• Leydold, Josef
• Stadler, Peter F.

Bibliographic Information

Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems

Türker Bıyıkoğlu, Josef Leydold, Peter F. Stadler

（Lecture notes in mathematics, 1915）

Springer, c2007

Note

Includes bibliographical references (p. [101]-111) and index

Description and Table of Contents

Description

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 Schroedinger equations on manifolds on the one hand, and their discrete analogs on graphs.

Table of Contents

Graph Laplacians.- Eigenfunctions and Nodal Domains.- Nodal Domain Theorems for Special Graph Classes.- Computational Experiments.- Faber-Krahn Type Inequalities.

by "Nielsen BookData"

Details

• NCID: BA82701703
• ISBN:
  • 9783540735090
• LCCN: 2007929852
• Country Code: gw
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Berlin
• Pages/Volumes: viii, 115 p.
• Size: 24 cm
• Classification:
  • LCC : QC20.7.M3
• Subject Headings:
  • LCSH : Eigenvectors
  • LCSH : Laplacian operator
  • LCSH : Graph theory
• Parent Bibliography ID:
  • BA00146586
• Link:
  • dx.doi.org/10.1007/978-3-540-73510-6