Laplacian Eigenvectors of Graphs Perron-Frobenius and Faber-Krahn Type Theorems /

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ödin...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Biyikoglu, Türker (Autor), Leydold, Josef (Autor), Stadler, Peter F. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Lecture Notes in Mathematics, 1915
Temas:
Algebra.
Discrete mathematics.
Algebras, Linear.
Discrete Mathematics.
Linear Algebra.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-73510-6
003 DE-He213
005 20220116151129.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540735106  |9 978-3-540-73510-6 
024 7 |a 10.1007/978-3-540-73510-6  |2 doi 
050 4 |a QA150-272 
072 7 |a PBF  |2 bicssc 
072 7 |a MAT002000  |2 bisacsh 
072 7 |a PBF  |2 thema 
082 0 4 |a 512  |2 23 
100 1 |a Biyikoglu, Türker.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Laplacian Eigenvectors of Graphs  |h [electronic resource] :  |b Perron-Frobenius and Faber-Krahn Type Theorems /  |c by Türker Biyikoglu, Josef Leydold, Peter F. Stadler. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a VIII, 120 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Mathematics,  |x 1617-9692 ;  |v 1915 
505 0 |a Graph Laplacians -- Eigenfunctions and Nodal Domains -- Nodal Domain Theorems for Special Graph Classes -- Computational Experiments -- Faber-Krahn Type Inequalities. 
520 |a 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. 
650 0 |a Algebra. 
650 0 |a Discrete mathematics. 
650 0 |a Algebras, Linear. 
650 1 4 |a Algebra. 
650 2 4 |a Discrete Mathematics. 
650 2 4 |a Linear Algebra. 
700 1 |a Leydold, Josef.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Stadler, Peter F.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540840664 
776 0 8 |i Printed edition:  |z 9783540735090 
830 0 |a Lecture Notes in Mathematics,  |x 1617-9692 ;  |v 1915 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-73510-6  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
912 |a ZDB-2-LNM 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares