Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs
Seiten
2024
Chapman & Hall/CRC (Verlag)
978-1-032-92007-8 (ISBN)
Chapman & Hall/CRC (Verlag)
978-1-032-92007-8 (ISBN)
This book presents results established over the past 40 years on Laplacian matrices of graphs developed using combinatorial matrix theory. The author focuses on the spectrum of Laplacian matrices, the algebraic connectivity of graphs, associated eigenvectors of the Laplacian matrix, and submatrices of the Laplacian matrix. All of these topics il
On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs.
Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs is a compilation of many of the exciting results concerning Laplacian matrices developed since the mid 1970s by well-known mathematicians such as Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann, Shader, Sunder, and more. The text is complemented by many examples and detailed calculations, and sections followed by exercises to aid the reader in gaining a deeper understanding of the material. Although some exercises are routine, others require a more in-depth analysis of the theorems and ask the reader to prove those that go beyond what was presented in the section.
Matrix-graph theory is a fascinating subject that ties together two seemingly unrelated branches of mathematics. Because it makes use of both the combinatorial properties and the numerical properties of a matrix, this area of mathematics is fertile ground for research at the undergraduate, graduate, and professional levels. This book can serve as exploratory literature for the undergraduate student who is just learning how to do mathematical research, a useful "start-up" book for the graduate student beginning research in matrix-graph theory, and a convenient reference for the more experienced researcher.
On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs.
Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs is a compilation of many of the exciting results concerning Laplacian matrices developed since the mid 1970s by well-known mathematicians such as Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann, Shader, Sunder, and more. The text is complemented by many examples and detailed calculations, and sections followed by exercises to aid the reader in gaining a deeper understanding of the material. Although some exercises are routine, others require a more in-depth analysis of the theorems and ask the reader to prove those that go beyond what was presented in the section.
Matrix-graph theory is a fascinating subject that ties together two seemingly unrelated branches of mathematics. Because it makes use of both the combinatorial properties and the numerical properties of a matrix, this area of mathematics is fertile ground for research at the undergraduate, graduate, and professional levels. This book can serve as exploratory literature for the undergraduate student who is just learning how to do mathematical research, a useful "start-up" book for the graduate student beginning research in matrix-graph theory, and a convenient reference for the more experienced researcher.
Matrix Theory Preliminaries. Graph Theory Preliminaries. Introduction to Laplacian Matrices. Algebraic Connectivity. The Fiedler Vector and Bottleneck Matrices for Trees. Bottleneck Matrices for Graphs. The Group Inverse of the Laplacian Matrix.
| Erscheinungsdatum | 16.10.2024 |
|---|---|
| Reihe/Serie | Discrete Mathematics and Its Applications |
| Zusatzinfo | 226 Illustrations, black and white |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Gewicht | 784 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Technik ► Elektrotechnik / Energietechnik | |
| Technik ► Umwelttechnik / Biotechnologie | |
| ISBN-10 | 1-032-92007-6 / 1032920076 |
| ISBN-13 | 978-1-032-92007-8 / 9781032920078 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
Eine Einführung mit Java
Buch | Hardcover (2020)
dpunkt (Verlag)
CHF 62,85
