EVOLUTION-MANAGER
Edit File: make_chordal_ring.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Create an extended chordal ring graph</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for make_chordal_ring {igraph}"><tr><td>make_chordal_ring {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Create an extended chordal ring graph</h2> <h3>Description</h3> <p><code>make_chordal_ring</code> 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 the ‘<code>W</code>’ matrix. The extra edges of vertex <code>i</code> are added according to column <code>i mod p</code> in ‘<code>W</code>’. The number of extra edges is the number of rows in ‘<code>W</code>’: for each row <code>j</code> an edge <code>i->i+w[ij]</code> is added if <code>i+w[ij]</code> is less than the number of total nodes. See also Kotsis, G: Interconnection Topologies for Parallel Processing Systems, PARS Mitteilungen 11, 1-6, 1993. </p> <h3>Usage</h3> <pre> make_chordal_ring(n, w, directed = FALSE) chordal_ring(...) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>n</code></td> <td> <p>The number of vertices.</p> </td></tr> <tr valign="top"><td><code>w</code></td> <td> <p>A matrix which specifies the extended chordal ring. See details below.</p> </td></tr> <tr valign="top"><td><code>directed</code></td> <td> <p>Logical scalar, whether or not to create a directed graph.</p> </td></tr> <tr valign="top"><td><code>...</code></td> <td> <p>Passed to <code>make_chordal_ring</code>.</p> </td></tr> </table> <h3>Value</h3> <p>An igraph graph. </p> <h3>See Also</h3> <p>Other deterministic constructors: <code><a href="graph_from_atlas.html">graph_from_atlas</a>()</code>, <code><a href="graph_from_edgelist.html">graph_from_edgelist</a>()</code>, <code><a href="graph_from_literal.html">graph_from_literal</a>()</code>, <code><a href="make_empty_graph.html">make_empty_graph</a>()</code>, <code><a href="make_full_citation_graph.html">make_full_citation_graph</a>()</code>, <code><a href="make_full_graph.html">make_full_graph</a>()</code>, <code><a href="make_graph.html">make_graph</a>()</code>, <code><a href="make_lattice.html">make_lattice</a>()</code>, <code><a href="make_ring.html">make_ring</a>()</code>, <code><a href="make_star.html">make_star</a>()</code>, <code><a href="make_tree.html">make_tree</a>()</code> </p> <h3>Examples</h3> <pre> chord <- make_chordal_ring(15, matrix(c(3, 12, 4, 7, 8, 11), nr = 2)) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>