Tampere University of Technology

TUTCRIS Research Portal

Quantifying structural complexity of graphs: Information measures in mathematical chemistry

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Details

Original languageEnglish
Title of host publicationQuantum Frontiers of Atoms and Molecules
EditorsMihai V. Putz
PublisherNova Science Publishers, Inc.
Pages479-497
Number of pages19
ISBN (Print)9781616681586
Publication statusPublished - 2011
Publication typeA3 Part of a book or another research book

Abstract

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.

ASJC Scopus subject areas