vix.ing · top · new · best · stats · spec

Largest Eigenvalue of the Laplacian Matrix

2015/02/14 by Benjamin Iriarte Giraldo, Giraldo, Benjamin Iriarte
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #Spectral Theory (math.SP) #Topological and Geometric Data Analysis #math.CO #math.SP

paper · pdf · doi:10.48550/arxiv.1502.04207

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

arxiv created 2015/02/14 · openalex publication_date 2015/02/14 · arxiv updated 2015/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Related