Entropy versus Heterogeneity for Graphs

From MaRDI portal

Revision as of 21:32, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3003442

Jump to:navigation, search

DOI10.1007/978-3-642-20844-7_4zbMath1381.05044OpenAlexW1554161302WikidataQ60431004 ScholiaQ60431004MaRDI QIDQ3003442

Lin Han, Edwin R. Hancock, Richard C. Wilson

Publication date: 27 May 2011

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20844-7_4

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (1)

Exploring the heterogeneity for node importance byvon Neumann entropy

This page was built for publication: Entropy versus Heterogeneity for Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3003442&oldid=16023498"