make_chordal_ring creates an extended chordal ring.
An extended chordal ring is regular graph, each node has the same
degree. It can be obtained from a simple ring by adding some extra
edges specified by a matrix. Let p denote the number of columns in
W’ matrix. The extra edges of vertex
are added according to column
i mod p in
W’. The number of extra edges is the number
of rows in ‘
W’: for each row
j an edge
i->i+w[ij] is added if
i+w[ij] is less than the number
of total nodes. See also Kotsis, G: Interconnection Topologies for
Parallel Processing Systems, PARS Mitteilungen 11, 1-6, 1993.
1 2 3
The number of vertices.
A matrix which specifies the extended chordal ring. See details below.
An igraph graph.
Other determimistic constructors:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.