igraph (version 0.3.2)

graph-isomorphism: Graph Isomorphism

Description

These functions deal with graph isomorphism.

Usage

graph.isoclass(graph)
graph.isomorphic(graph1, graph2)
graph.isocreate(size, number, directed=TRUE)

Arguments

graph

A graph object.

graph1,graph2

Graph objects

size

A numeric integer giving the number of vertices in the graph to create. Only three or four are suppported right now.

number

The number of the isomorphism class of the graph to be created.

directed

Whether to create a directed graph.

Value

• graph.isoclass returns a non-negative integer number.

  graph.isomorphic returns a logical constant.

  graph.isocreate returns a graph object.

Details

graph.isoclass returns the isomorphism class of a graph, a non-negative integer number. Graphs (with the same number of vertices) having the same isomorphism class are isomorphic and isomorphic graphs always have the same isomorphism class.

graph.isomorphic decides whether two graphs are isomorphic.

graph.isocreate create a graph from the given isomorphic class. These functions are considered as experimental, as they can handle only graphs with three of four vertices.

See Also

graph.motifs

Examples

# create some non-isomorphic graphs
g1 <- graph.isocreate(3, 10)
g2 <- graph.isocreate(3, 11)
graph.isoclass(g1)
graph.isomorphic(g1, g2)

Run the code above in your browser using DataCamp Workspace