Skip to content
Home/ Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems (2007)
Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems (2007)

Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems (2007)

by Biyikoglu, Türker
No customer reviews yet ISBN 9783540735090

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.

About the author

Product details

Pub dateJul 26, 2007
ISBN-103540735097
ISBN-139783540735090
LanguageEnglish
Last updated 2026-03-13 10:24
$47.07
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Mathematics | Graphic Methods
See all
Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches
<i> <p>Fixed Point Theory and Graph Theory</i> provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. </p> <p>This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. </p> <p>The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.</p>
$115.75
Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek
$219.75
Random Geometric Graphs
Penrose, Mathew
$219.75
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$214.27
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$110.03
Graph Decompositions: A Study in Infinite Graph Theory
Diestel, Reinhard
$100.15