distanceDegreeCompactness: Compactness measure based on distance degrees

In QuACN: QuACN: Quantitative Analysis of Complex Networks

Description

This method calculates a compactness measure based on recognizing the center of a graph and analyzing the distance degrees of the vertices in all of its j-spheres.

Note that this function only gives reliable results for acyclic graphs.

Usage

  distanceDegreeCompactness(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 distance-degree-based compactness value as a double-precision floating point value.

Author(s)

Michael Schutte

References

S. C. Basak, A. T. Balaban and S. Bertelsen, New centric topological indexes for acyclic molecules (trees) and substituents (rooted trees), and coding of rooted trees, MATCH Commun. Math. Comput. Chem., 30:55-72, 1994

Examples

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

distanceDegreeCompactness(g)

QuACN documentation built on May 2, 2019, 5:46 p.m.