Spectrum and entropy for infinite directed graphs
From MaRDI portal
Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Infinite graphs (05C63) Applications of graph theory (05C90) Spectrum, resolvent (47A10) Numerical range, numerical radius (47A12) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)
Recommendations
Cited in
(9)- Isospectral reduction in infinite graphs
- scientific article; zbMATH DE number 4208879 (Why is no real title available?)
- scientific article; zbMATH DE number 167195 (Why is no real title available?)
- scientific article; zbMATH DE number 3940 (Why is no real title available?)
- Entropy of Digraphs and Infinite Networks
- scientific article; zbMATH DE number 4196741 (Why is no real title available?)
- Spectral properties of matrices associated with some directed graphs
- Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
- Hilbert evolution algebras, weighted digraphs, and nilpotency
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)