| 書目名稱 | Laplacian Eigenvectors of Graphs |
| 副標題 | Perron-Frobenius and |
| 編輯 | Türker Biyiko?u,Josef Leydold,Peter F. Stadler |
| 視頻video | http://file.papertrans.cn/582/581310/581310.mp4 |
| 叢書名稱 | Lecture Notes in Mathematics |
| 圖書封面 |  |
| 描述 | .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.. |
| 出版日期 | Book 2007 |
| 關鍵詞 | Eigenvector; Graph; Perron-Frobenius Theorem; algorithms; discrete Dirichlet problem; graph Laplacian; nod |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-540-73510-6 |
| isbn_softcover | 978-3-540-73509-0 |
| isbn_ebook | 978-3-540-73510-6Series ISSN 0075-8434 Series E-ISSN 1617-9692 |
| issn_series | 0075-8434 |
| copyright | Springer-Verlag Berlin Heidelberg 2007 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 16:32
發(fā)表于 2025-3-21 18:50:51
