Skip to main content
  • Book
  • © 2007

Laplacian Eigenvectors of Graphs

Perron-Frobenius and Faber-Krahn Type Theorems

Part of the book series: Lecture Notes in Mathematics (LNM, volume 1915)

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (6 chapters)

  1. Front Matter

    Pages I-VIII
  2. Introduction

    Pages 1-14
  3. Graph Laplacians

    Pages 15-27
  4. Back Matter

    Pages 93-115

About this book

Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) “Geometric” properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.

The volume investigates the structure of eigenvectors and looks at the number of their sign graphs (“nodal domains”), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology.

Reviews

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)

Authors and Affiliations

  • Işik University, Istanbul, Turkey

    Türker Biyikoğu

  • Vienna University of Economics and Business Administration, Wien, Austria

    Josef Leydold

  • University of Leipzig, Leipzig, Germany

    Peter F. Stadler

Bibliographic Information

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access