# isomorphism_class

##### Isomorphism class of a graph

The isomorphism class is 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. Currently it can handle only graphs with 3 or 4 vertices.

##### Usage

`isomorphism_class(graph, v)`

##### Arguments

- graph
The input graph.

- v
Optionally a vertex sequence. If not missing, then an induced subgraph of the input graph, consisting of this vertices, is used.

##### Value

An integer number.

##### See Also

Other graph isomorphism: `count_isomorphisms`

,
`graph.count.isomorphisms.vf2`

;
`count_subgraph_isomorphisms`

,
`graph.count.subisomorphisms.vf2`

;
`graph.get.isomorphisms.vf2`

,
`isomorphisms`

;
`graph.get.subisomorphisms.vf2`

,
`subgraph_isomorphisms`

;
`graph.isocreate`

,
`graph_from_isomorphism_class`

;
`graph.isomorphic`

,
`graph.isomorphic.34`

,
`graph.isomorphic.bliss`

,
`graph.isomorphic.vf2`

,
`is_isomorphic_to`

, `isomorphic`

;
`graph.subisomorphic.lad`

,
`graph.subisomorphic.vf2`

,
`is_subgraph_isomorphic_to`

,
`subgraph_isomorphic`

##### Examples

```
# NOT RUN {
# create some non-isomorphic graphs
g1 <- graph_from_isomorphism_class(3, 10)
g2 <- graph_from_isomorphism_class(3, 11)
isomorphism_class(g1)
isomorphism_class(g2)
isomorphic(g1, g2)
# }
```

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