# count_subgraph_isomorphisms

##### Count the isomorphic mappings between a graph and the subgraphs of another graph

Count the isomorphic mappings between a graph and the subgraphs of another graph

##### Usage

`count_subgraph_isomorphisms(pattern, target, method = c("lad", "vf2"), ...)`

##### Arguments

- pattern
- The smaller graph, it might be directed or undirected. Undirected graphs are treated as directed graphs with mutual edges.
- target
- The bigger graph, it might be directed or undirected. Undirected graphs are treated as directed graphs with mutual edges.
- method
- The method to use. Possible values:
lad ,vf2 . See their details below. - ...
- Additional arguments, passed to the various methods.

##### Value

- Logical scalar,
`TRUE`

if the`pattern`

is isomorphic to a (possibly induced) subgraph of`target`

.

##### References

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.

C. Solnon: AllDifferent-based Filtering for Subgraph Isomorphism,
*Artificial Intelligence* 174(12-13):850--864, 2010.

##### See Also

Other graph isomorphism: `count_isomorphisms`

,
`graph.count.isomorphisms.vf2`

;
`graph.get.isomorphisms.vf2`

,
`isomorphisms`

;
`graph.get.subisomorphisms.vf2`

,
`subgraph_isomorphisms`

;
`graph.isoclass`

,
`graph.isoclass.subgraph`

,
`isomorphism_class`

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

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