graphVertexComplexity: Graph Vertex Complexity

In QuACN: QuACN: Quantitative Analysis of Complex Networks

Description

This method calculates the Graph Vertex Complexity.

Usage

graphVertexComplexity(g, dist = NULL)

Arguments

g	a graph as a graphNEL object.
dist	the distance matrix of the graph. If the parameter is empty the distance matrix will be calculated within the function.

Value

This method returns the Graph Vertex Complexity.

Author(s)

Laurin Mueller

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, Journal of Computational Chemistry, vol. 5, pp. 581-588, 1984.

Examples

library(RBGL)
set.seed(123)
g <- randomGraph(1:8, 1:5, 0.36, weights=FALSE)

graphVertexComplexity(g)

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