Count the number of isomorphic mappings between two graphsSource:
Count the number of isomorphic mappings between two graphs
The first graph.
The second graph.
Currently only ‘vf2’ is supported, see
isomorphic()for details about it and extra arguments.
Passed to the individual methods.
LP Cordella, P Foggia, C Sansone, and M Vento: An improved algorithm for matching large graphs, Proc. of the 3rd IAPR TC-15 Workshop on Graphbased Representations in Pattern Recognition, 149--159, 2001.
# colored graph isomorphism g1 <- make_ring(10) g2 <- make_ring(10) isomorphic(g1, g2) #>  TRUE V(g1)$color <- rep(1:2, length = vcount(g1)) V(g2)$color <- rep(2:1, length = vcount(g2)) # consider colors by default count_isomorphisms(g1, g2) #>  10 # ignore colors count_isomorphisms(g1, g2, vertex.color1 = NULL, vertex.color2 = NULL ) #>  20