Applications of combinatorial matrix theory to Laplacian matrices of graphs
"Preface On the surface, matrix theory and graph theory are seemingly very different branches of mathematics. However, these two branches of mathematics interact since it is often convenient to represent a graph as a matrix. Adjacency, Laplacian, and incidence matrices are commonly used to repr...
Saved in:
Main Author: | |
---|---|
Corporate Author: | |
Format: | Electronic eBook |
Language: | English |
Published: |
Boca Raton, Fla. :
CRC Press,
[2012]
|
Series: | Discrete mathematics and its applications.
|
Subjects: | |
Online Access: |
Full text (WIT users only) |
Table of Contents:
- 1. Matrix theory preliminaries
- 2. Graph theory preliminaries
- 3. Introduction to Laplacian matrices
- 4. The spectra of Laplacian matrices
- 5. The algebraic connectivity
- 6. The Fiedler vector and bottleneck matrices for trees
- 7. Bottleneck matrices for graphs
- 8. The group inverse of the Laplacian matrix.