QuACN (version 1.8.0)

twoEdgesDeletedSubgraphComplexity: Two-edges-deleted subgraph complexity

Description

This method calculates the two-edges-deleted subgraph complexity based on Laplacian matrices.

Usage

twoEdgesDeletedSubgraphComplexity(g, two.eds = NULL)

Arguments

g

a graph as a graphNEL object.

two.eds

the two-edges-deleted subgraphs of g as a list of adjacency matrices, as returned by edgeDeletedSubgraphs(edgeDeletedSubgraphs(g)). If this parameter is omitted, the subgraphs will be calculated automatically.

Value

The return value is the described two-edges-deleted subgraph complexity measure as a double-precision floating point number.

Details

This method calculates the two-edges-deleted subgraph complexity with respect to different spectra of the Laplacian and signless Laplacian matrix.

References

J. Kim and T. Wilhelm. What is a complex graph? Physica A, 387:2637-2652, 2008

Examples

library(graph)
set.seed(123)
g <- randomEGraph(as.character(1:12), 0.5)

twoEdgesDeletedSubgraphComplexity(g)