A history of graph entropy measures

By Matthias Dehmer, Abbe Mowshowitz. Information Sciences, 2011

556 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Molecular Biology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/d6867e2c731b7e68b408e57dc7188334b74cfdf8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Sergey V. Krivovichev
2. Lavanya Sivakumar
3. Matthias Dehmer

In Molecular Biology

1. Lavanya Sivakumar
2. Sergey V. Krivovichev
3. Matthias Dehmer
4. Fabián Riquelme
5. Pablo Gonzalez Cantergiani

In Statistical and Nonlinear Physics

1. Lavanya Sivakumar
2. Sergey V. Krivovichev
3. Matthias Dehmer
4. Fabián Riquelme
5. Pablo Gonzalez Cantergiani

Citations in the corpus

• Uniquely Discriminating Molecular Structures Using Novel Eigenvalue-Based Descriptors (2012, methodology): “We start by defining a probability distribution PG(V ) on the vertices of a given graph using an arbitrary information functional that captures the structural information of a graph, see [11, 12].”
• Structural complexity of minerals: information storage and processing in the mineral world (2013, methodology): “The seminal work by Rashevsky (1955) was followed by extensive work summarized by Dehmer and Mowshowitz (2011).”