Largest Eigenvalue of the Laplacian Matrix
Combinatorics
2015-02-17 v1 Spectral Theory
Abstract
We study the eigenspace of the Laplacian matrix of a simple graph corresponding to the largest eigenvalue, subsequently arriving at the theory of modular decomposition of T. Gallai.
Keywords
Cite
@article{arxiv.1502.04207,
title = {Largest Eigenvalue of the Laplacian Matrix},
author = {Benjamin Iriarte Giraldo},
journal= {arXiv preprint arXiv:1502.04207},
year = {2015}
}
Comments
Following an editorial request, this is the second part of the article originally available in arxiv:1405.4880v1, corresponding to Section 6 of that manuscript. Several clarification comments and improvements to the original exposition were added, and the introduction and background materials are new. No new mathematical content was added. Submitted for publication