# make_chordal_ring

##### Create an extended chordal ring graph

`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
the `W`

`i`

are added according to column `i mod p`

in
`W`

`W`

`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.

##### Usage

`make_chordal_ring(n, w)`chordal_ring(...)

##### Arguments

- n
- The number of vertices.
- w
- A matrix which specifies the extended chordal ring. See details below.
- ...
- Passed to
`make_chordal_ring`

.

##### Value

- An igraph graph.

##### See Also

Other determimistic constructors: `atlas`

,
`graph.atlas`

,
`graph_from_atlas`

;
`directed_graph`

, `graph`

,
`graph.famous`

,
`make_directed_graph`

,
`make_graph`

,
`make_undirected_graph`

,
`undirected_graph`

;
`empty_graph`

, `graph.empty`

,
`make_empty_graph`

;
`from_edgelist`

,
`graph.edgelist`

,
`graph_from_edgelist`

;
`from_literal`

, `graph.formula`

,
`graph_from_literal`

;
`full_citation_graph`

,
`graph.full.citation`

,
`make_full_citation_graph`

;
`full_graph`

, `graph.full`

,
`make_full_graph`

;
`graph.lattice`

, `lattice`

,
`make_lattice`

; `graph.ring`

,
`make_ring`

, `ring`

;
`graph.star`

, `make_star`

,
`star`

; `graph.tree`

,
`make_tree`

, `tree`

##### Examples

```
chord <- make_chordal_ring(15,
matrix(c(3, 12, 4, 7, 8, 11), nr = 2))
```

*Documentation reproduced from package igraph, version 1.0.0, License: GPL (>= 2)*