Computing and interpreting the adjacency spectrum of traffic networks

DOI10.1016/0377-0427(85)90039-1zbMath0588.90051OpenAlexW2093138254MaRDI QIDQ1073716

Christoph Maas

Publication date: 1985

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(85)90039-1

zbMATH Keywords

eigenvalueseigenvectorsadjacency matrixgeographical interpretation of graph spectraNetworks of transportation routes

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Operations research and management science (90B99)

Related Items (2)

Transportation in graphs and the admittance spectrum ⋮ The largest eigenvalue of a graph: A survey

Cites Work

• Spektren endlicher Grafen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing and interpreting the adjacency spectrum of traffic networks