The spectra of Manhattan street networks
From MaRDI portal
Publication:947647
DOI10.1016/j.laa.2008.05.018zbMath1144.05316OpenAlexW2005728972WikidataQ57772712 ScholiaQ57772712MaRDI QIDQ947647
C. Dalfó, Margarida Mitjana, Francesc Comellas, Miquel Àngel Fiol
Publication date: 6 October 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.018
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items
Asymptotic spectral distributions of Manhattan products of \(C_{n}\sharp P_{m}\) ⋮ Spectra of digraphs ⋮ Complex adjacency spectra of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The diameter and Laplacian eigenvalues of directed graphs
- The spectra of some families of digraphs
- Problems in algebraic combinatorics
- Optimal communication algorithms for Manhattan Street networks
- Weakly distance-regular digraphs.
- Explicit Concentrators from Generalized N-Gons
- Line Digraph Iterations and the (d, k) Digraph Problem
- Multidimensional Manhattan Street Networks
- Diameters and Eigenvalues
- Design and analysis of multidimensional Manhattan street networks
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian