oneEdgeDeletedSubgraphComplexity: One-edge-deleted subgraph complexity measures
In QuACN: QuACN: Quantitative Analysis of Complex Networks
Description
Usage
Arguments
Details
Value
Author(s)
References
Examples
View source: R/oneEdgeDeletedSubgraphComplexity.R
Description
This method calculates two indices based on
one-edge-deleted subgraphs.
Usage
1
oneEdgeDeletedSubgraphComplexity(g, one.eds = NULL)
Arguments
g
a graph as a graphNEL object.
one.eds
the one-edge-deleted subgraphs of g as a list of adjacency matrices, as
returned by edgeDeletedSubgraphs(g). If this parameter is omitted, the
subgraphs will be calculated automatically.
Details
This method calculates the one-edge-deleted subgraph complexity with
respect to the different number of spanning trees (C_1eST) and spectra
of the Laplacian and signless Laplacian matrix (C_1eSpec).
Value
The results are returned in a list with two entries named C_1eST and
C_1eSpec.
Author(s)
Lavanya Sivakumar, Michael Schutte
References
J. Kim and T. Wilhelm. What is a complex graph? Physica A,
387:2637-2652, 2008
Examples
1
2
3
4
5
6
7
library(graph)
set.seed(123)
g <- randomEGraph(as.character(1:12), 0.5)
result <- oneEdgeDeletedSubgraphComplexity(g)
result$C_1eST
result$C_1eSpec
QuACN documentation built on May 2, 2019, 5:46 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Author(s) References Examples
View source: R/oneEdgeDeletedSubgraphComplexity.R
Description
This method calculates two indices based on one-edge-deleted subgraphs.
Usage
1 | oneEdgeDeletedSubgraphComplexity(g, one.eds = NULL)
|
Arguments
g |
a graph as a graphNEL object. |
one.eds |
the one-edge-deleted subgraphs of g as a list of adjacency matrices, as returned by edgeDeletedSubgraphs(g). If this parameter is omitted, the subgraphs will be calculated automatically. |
Details
This method calculates the one-edge-deleted subgraph complexity with respect to the different number of spanning trees (C_1eST) and spectra of the Laplacian and signless Laplacian matrix (C_1eSpec).
Value
The results are returned in a list with two entries named C_1eST and C_1eSpec.
Author(s)
Lavanya Sivakumar, Michael Schutte
References
J. Kim and T. Wilhelm. What is a complex graph? Physica A, 387:2637-2652, 2008
Examples
1 2 3 4 5 6 7 | library(graph)
set.seed(123)
g <- randomEGraph(as.character(1:12), 0.5)
result <- oneEdgeDeletedSubgraphComplexity(g)
result$C_1eST
result$C_1eSpec
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.