Description Usage Arguments Details Value Author(s) References Examples
View source: R/twoEdgesDeletedSubgraphComplexity.R
This method calculates the two-edges-deleted subgraph complexity based on Laplacian matrices.
1 | twoEdgesDeletedSubgraphComplexity(g, two.eds = NULL)
|
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. |
This method calculates the two-edges-deleted subgraph complexity with respect to different spectra of the Laplacian and signless Laplacian matrix.
The return value is the described two-edges-deleted subgraph complexity measure as a double-precision floating point number.
Lavanya Sivakumar, Michael Schutte <michi@uiae.at>
J. Kim and T. Wilhelm. What is a complex graph? Physica A, 387:2637-2652, 2008
1 2 3 4 5 | library(graph)
set.seed(123)
g <- randomEGraph(as.character(1:12), 0.5)
twoEdgesDeletedSubgraphComplexity(g)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.