Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations

DOI10.1137/15M1008737zbMath1351.05142MaRDI QIDQ2835840

Benjamin Iriarte

Publication date: 30 November 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

largest eigenvalueLaplacian matrixorientationmodular decompositiongraph spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76) Special matrices (15B99)

Related Items (1)

Weight allocation in Laplacian matrix of random networks based on geodesic distances

Cites Work

• Spectra of graphs
• Almost all comparability graphs are UPO
• Laplacian graph eigenvectors
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations