Spectrum and entropy for infinite directed graphs
DOI10.1007/978-0-8176-4789-6_5zbMATH Open1221.05232OpenAlexW75243790MaRDI QIDQ3064397FDOQ3064397
Authors: Jun-Ichi Fujii
Publication date: 21 December 2010
Published in: Structural Analysis of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-8176-4789-6_5
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Paths and cycles (05C38) Infinite graphs (05C63) Spectrum, resolvent (47A10) Numerical range, numerical radius (47A12)
Cited In (6)
- Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
- Hilbert evolution algebras, weighted digraphs, and nilpotency
- Spectral properties of matrices associated with some directed graphs
- Title not available (Why is that?)
- Isospectral reduction in infinite graphs
- Entropy of Digraphs and Infinite Networks
This page was built for publication: Spectrum and entropy for infinite directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064397)