Cartesian product of two graphs — graph

Compute the Cartesian product of two graphs

Usage

graph_cartesian(g, h)

Arguments

g: An igraph object
h: An igraph object

Value

Cartesian product as igraph object

Details

See https://en.wikipedia.org/wiki/Cartesian_product_of_graphs. The result is undirected and its vertices are named "u-v", where u and v are the names (or ids) of the vertices in g and h.

Author

David Schoch

Examples

library(igraph)
g <- make_ring(4)
h <- make_full_graph(2)
graph_cartesian(g, h)
#> IGRAPH 1503e80 UN-- 8 12 -- 
#> + attr: name (v/c)
#> + edges from 1503e80 (vertex names):
#>  [1] 1-1--2-1 1-2--2-2 2-1--3-1 2-2--3-2 3-1--4-1 3-2--4-2 1-1--4-1 1-2--4-2
#>  [9] 1-1--1-2 2-1--2-2 3-1--3-2 4-1--4-2