Entropy, orbits, and spectra of graphs

zbMATH Open1252.68158MaRDI QIDQ2906533FDOQ2906533

Authors: Abbe Mowshowitz, Valia Mitsou 

Publication date: 5 September 2012

zbMATH Keywords

entropysymmetryShannon entropyKolmogorov complexitystructural complexityentropy measuresymmetry transformationcomplexity measuregraph cmplexity measure

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (5)

• Subjectively interesting connecting trees and forests
• Title not available (Why is that?)
• Inequalities for entropy-based measures of network information content
• Quasi-graphs, zero entropy and measures with discrete spectrum
• Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach

This page was built for publication: Entropy, orbits, and spectra of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906533)