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

zbMATH Keywords

entropyspectrumfractalnumerical rangecoding theoryinfinite directed graph

Mathematics Subject Classification ID

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)

Recommendations

• A Survey on Spectra of infinite Graphs
• scientific article; zbMATH DE number 4196741
• scientific article; zbMATH DE number 167195
• scientific article; zbMATH DE number 733160
• On the spectra of connected graphs

Cited in

(6)

• Isospectral reduction in infinite graphs
• Entropy of Digraphs and Infinite Networks
• scientific article; zbMATH DE number 167195 (Why is no real title available?)
• Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
• Spectral properties of matrices associated with some directed 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)