An iterative construction of isospectral digraphs
From MaRDI portal
Publication:2275364
DOI10.1016/j.disc.2011.03.018zbMath1223.05102MaRDI QIDQ2275364
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.018
Related Items
The spectra of digraphs with Morita equivalent \(C^\ast\)-algebras, A note on the spectral characterization of strongly connected bicyclic digraphs
Cites Work
- Constructing cospectral graphs
- Spectra of digraphs
- An infinite family of graphs with the same Ihara zeta function
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- Constructing isospectral non‐isomorphic digraphs from hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item