TY - CHAP
T1 - Quantifying structural complexity of graphs
T2 - Information measures in mathematical chemistry
AU - Dehmer, Matthias
AU - Emmert-Streib, Frank
AU - Tsoy, Yury Robertovich
AU - Varmuza, Kurt
PY - 2011
Y1 - 2011
N2 - In this chapter, we give a conceptional view about information measures for graphs which can be used to quantify their structural complexity. We focus on treating such measures in the context of mathematical chemistry but we want to mention that those are also applicable for arbitrary complex networks. Besides reviewing the most known information indices often used in chemical graph theory, we propose an information functional that is based on degree-degree associations in a graph. This leads us to a parametric graph entropy measure to quantify the structural information content of a graph. A brief numerical example shows how the measure can be calculated explicitly.
AB - In this chapter, we give a conceptional view about information measures for graphs which can be used to quantify their structural complexity. We focus on treating such measures in the context of mathematical chemistry but we want to mention that those are also applicable for arbitrary complex networks. Besides reviewing the most known information indices often used in chemical graph theory, we propose an information functional that is based on degree-degree associations in a graph. This leads us to a parametric graph entropy measure to quantify the structural information content of a graph. A brief numerical example shows how the measure can be calculated explicitly.
UR - http://www.scopus.com/inward/record.url?scp=84895219944&partnerID=8YFLogxK
M3 - Chapter
SN - 9781616681586
SP - 479
EP - 497
BT - Quantum Frontiers of Atoms and Molecules
A2 - Putz, Mihai V.
PB - Nova Science Publishers, Inc.
ER -