graphDistanceComplexity: Graph distance complexity measure

In QuACN: QuACN: Quantitative Analysis of Complex Networks

Description

This method calculates the graph distance complexity measure.

Usage

  graphDistanceComplexity(g, dist=NULL)

Arguments

g	a graph as a graphNEL object.
dist	the distance matrix of the graph. Will be calculated automatically if not supplied.

Value

The graph distance complexity measure as a double-precision floating point value.

Author(s)

Michael Schutte

References

C. Raychaudhury, S. K. Ray, J. J. Ghosh, A. B. Roy and S. C. Basak, Discrimination of isomeric structures using information theoretic topological indices, J. Comput. Chem., 5:581-588, 1984

Examples

set.seed(987)
g <- randomEGraph(as.character(1:10), 0.3)

graphDistanceComplexity(g)

QuACN documentation built on May 2, 2019, 8:18 a.m.