Eigenvalues, Multiplicities and Graphs: Cambridge Tracts in Mathematics, cartea 211
Autor Charles R. Johnson, Carlos M. Saiagoen Limba Engleză Hardback – 11 feb 2018
Din seria Cambridge Tracts in Mathematics
- 8% Preț: 474.31 lei
- Preț: 347.24 lei
- 8% Preț: 452.90 lei
- 11% Preț: 505.41 lei
- 8% Preț: 445.08 lei
- 9% Preț: 661.65 lei
- Preț: 181.97 lei
- Preț: 182.16 lei
- Preț: 181.80 lei
- Preț: 182.16 lei
- Preț: 181.60 lei
- Preț: 181.43 lei
- Preț: 181.97 lei
- Preț: 181.80 lei
- 14% Preț: 679.09 lei
- Preț: 181.97 lei
- Preț: 181.60 lei
- Preț: 181.60 lei
- Preț: 210.35 lei
- Preț: 298.03 lei
- Preț: 210.51 lei
- Preț: 182.53 lei
- Preț: 181.05 lei
- Preț: 181.60 lei
- Preț: 375.24 lei
- Preț: 371.99 lei
- Preț: 441.80 lei
- 11% Preț: 560.32 lei
- 11% Preț: 434.41 lei
- 11% Preț: 402.84 lei
- Preț: 436.41 lei
- Preț: 438.99 lei
- Preț: 411.83 lei
- Preț: 436.41 lei
- Preț: 422.90 lei
- 11% Preț: 496.07 lei
- 14% Preț: 762.04 lei
- Preț: 297.80 lei
Preț: 768.63 lei
Preț vechi: 893.76 lei
-14% Nou
Puncte Express: 1153
Preț estimativ în valută:
147.11€ • 153.33$ • 122.47£
147.11€ • 153.33$ • 122.47£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781107095458
ISBN-10: 110709545X
Pagini: 310
Dimensiuni: 158 x 236 x 23 mm
Greutate: 0.57 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Mathematics
Locul publicării:New York, United States
ISBN-10: 110709545X
Pagini: 310
Dimensiuni: 158 x 236 x 23 mm
Greutate: 0.57 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Mathematics
Locul publicării:New York, United States
Cuprins
Background; 1. Introduction; 2. Parter-Wiener, etc. theory; 3. Maximum multiplicity for trees, I; 4. Multiple eigenvalues and structure; 5. Maximum multiplicity, II; 6. The minimum number of distinct eigenvalues; 7. Construction techniques; 8. Multiplicity lists for generalized stars; 9. Double generalized stars; 10. Linear trees; 11. Non-trees; 12. Geometric multiplicities for general matrices over a field.
Recenzii
'The authors offer a unique and modern exploration into the eigenvalues associated with a graph, well beyond the classical treatments. This well-written and comprehensive monograph is ideal for newcomers to this subject and will be beneficial for experienced practitioners as well.' Shaun M. Fallat, University of Regina, Canada
'The undirected graph of a real symmetric matrix tells you the sparsity structure of the matrix. That seems too little information to constrain the eigenvalues. Nevertheless as the matrix gets sparser some constraints appear, not on the actual eigenvalues but on their (algebraic) multiplicities. When the graph is sparse enough to be a tree there is a lot to say. The authors have collected scattered results, filled in key omissions, imposed systematic notation and concepts so that a rich and subtle theory, blending trees and matrices, unfolds before the reader. I, for one, am grateful.' Beresford Parlett, University of California, Berkeley
'This book provides a comprehensive survey and fresh perspectives on a fundamental inverse problem: how does the structure of a matrix impact its spectral properties? The inclusion of recently developed techniques, results and open questions will foster future research and applications.' Bryan Shader, University of Wyoming.
'The authors mention in the introduction that one goal of this book is to put together in one convenient place the fundamental ideas in this area to make it easier for students and new researchers on this subject to get started on some of the problems in the field. I believe that this goal has been achieved.' Sebastian M. Cioaba, Mathematical Reviews
'In this book, the multiplicity of eigenvalues in graph theory is discussed in detail. No matter the theoretical knowledge or the way of thinking of the reader, this book has good learning and reference value. At the same time, it also plays a great role in readers' study and research. Therefore, it is a meaningful book.' Xiaogang Liu, zbMATH
'The undirected graph of a real symmetric matrix tells you the sparsity structure of the matrix. That seems too little information to constrain the eigenvalues. Nevertheless as the matrix gets sparser some constraints appear, not on the actual eigenvalues but on their (algebraic) multiplicities. When the graph is sparse enough to be a tree there is a lot to say. The authors have collected scattered results, filled in key omissions, imposed systematic notation and concepts so that a rich and subtle theory, blending trees and matrices, unfolds before the reader. I, for one, am grateful.' Beresford Parlett, University of California, Berkeley
'This book provides a comprehensive survey and fresh perspectives on a fundamental inverse problem: how does the structure of a matrix impact its spectral properties? The inclusion of recently developed techniques, results and open questions will foster future research and applications.' Bryan Shader, University of Wyoming.
'The authors mention in the introduction that one goal of this book is to put together in one convenient place the fundamental ideas in this area to make it easier for students and new researchers on this subject to get started on some of the problems in the field. I believe that this goal has been achieved.' Sebastian M. Cioaba, Mathematical Reviews
'In this book, the multiplicity of eigenvalues in graph theory is discussed in detail. No matter the theoretical knowledge or the way of thinking of the reader, this book has good learning and reference value. At the same time, it also plays a great role in readers' study and research. Therefore, it is a meaningful book.' Xiaogang Liu, zbMATH
Notă biografică
Descriere
This book investigates the influence of the graph of a symmetric matrix on the multiplicities of its eigenvalues.