Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations
We study the eigenspace with largest eigenvalue of the Laplacian matrix of a simple graph. We find a surprising connection of this space with the theory of modular decomposition of Gallai, whereby eigenvectors can be used to discover modules. In the case of comparability graphs, eigenvectors are use...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2017-06-22T20:43:28Z.
|
| Subjects: | |
| Online Access: | Get fulltext |