Description Usage Arguments Details Value Author(s)
A function for creating an omnibus graph from arbitrarily many input graphs with matched vertex sets.
1 | gs.omni(A1, A2)
|
A1 |
the first |
A2 |
the second |
Given A_1, A_2, ..., A_m a collection of (possibly weighted) adjacency matrices of a collection of m undirected graphs with matched vertices. Then the mn by mn Omnibus Matrix has the subgraph where M_{ij} = 1/2 (A_i + A_j).
the omnibus matrix, as an object of class igraph. The vertices are concatenated to form one
Youngser Park
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.