Information indices with high discriminative power for graphs.
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based on so-called information functionals and compare the results with other information indices and non-information-theoretic measures such as the well-known Balaban J index. We show that, by employing a...
Main Authors: | Matthias Dehmer, Martin Grabner, Kurt Varmuza |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2012-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC3290601?pdf=render |
Similar Items
-
The discrimination power of structural SuperIndices.
by: Matthias Dehmer, et al.
Published: (2013-01-01) -
Correction: The Discrimination Power of Structural SuperIndices
by: Matthias Dehmer, et al.
Published: (2013-01-01) -
Correction: The Discrimination Power of Structural SuperIndices.
by: Matthias Dehmer, et al.
Published: (2013-01-01) -
Structural discrimination of networks by using distance, degree and eigenvalue-based measures.
by: Matthias Dehmer, et al.
Published: (2012-01-01) -
Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.
by: Matthias Dehmer, et al.
Published: (2015-01-01)