WOLFRAM

Wolfram Language & System Documentation Center

FindIsomorphicSubgraph[g1,g2]

finds a subgraph of g1 that is isomorphic to g2.

FindIsomorphicSubgraph[g1,g2,n]

finds at most n subgraphs.

Details and Options
Details and Options Details and Options
Examples  
Basic Examples  
Scope  
Specification  
Enumeration  
Applications  
Properties & Relations  
See Also
Related Guides
History
Cite this Page

FindIsomorphicSubgraph

FindIsomorphicSubgraph[g1,g2]

finds a subgraph of g1 that is isomorphic to g2.

FindIsomorphicSubgraph[g1,g2,n]

finds at most n subgraphs.

Details and Options

Examples

open all close all

Basic Examples  (2)

Find a subgraph that is isomorphic to a graph:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Find all subgraphs that are isomorphic to a graph:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image], All]

Scope  (7)

Specification  (4)

FindIsomorphicSubgraph works with undirected graphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Directed graphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Edge-tagged graphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Weighted graphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Enumeration  (3)

Find a subgraph that is isomorphic to a graph:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image]]

Find at most two isomorphic subgraphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image], 2]

Find all isomorphic subgraphs:

Wolfram Language code: FindIsomorphicSubgraph[[image], [image], All]

Applications  (2)

Find a substructure of a chemical structure graph that is isomorphic to the given graph:

Wolfram Language code: g = ChemicalData["Caffeine", "StructureGraph"]
Wolfram Language code: FindIsomorphicSubgraph[g, CycleGraph[6]]

Count the frequency of a motif in a directed family marriage network:

Wolfram Language code: g = [image];
Wolfram Language code: h = [image];
Wolfram Language code: Length[FindIsomorphicSubgraph[g, h, All]]

Highlight one instance of the motif:

Wolfram Language code: HighlightGraph[g, FindIsomorphicSubgraph[g, h]]

Properties & Relations  (2)

Test whether a graph and a subgraph are isomorphic using IsomorphicSubgraphQ:

Wolfram Language code: {h, g} = {CycleGraph[4], HypercubeGraph[3]}
Wolfram Language code: FindSubgraphIsomorphism[h, g]
Wolfram Language code: IsomorphicSubgraphQ[h, g]

Use FindSubgraphIsomorphism to find a subgraph isomorphism:

Wolfram Language code: FindSubgraphIsomorphism[[image], [image]]
Wolfram Research (2021), FindIsomorphicSubgraph, Wolfram Language function, https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html.

Text

Wolfram Research (2021), FindIsomorphicSubgraph, Wolfram Language function, https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html.

CMS

Wolfram Language. 2021. "FindIsomorphicSubgraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html.

APA

Wolfram Language. (2021). FindIsomorphicSubgraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html

BibTeX

@misc{reference.wolfram_2026_findisomorphicsubgraph, author="Wolfram Research", title="{FindIsomorphicSubgraph}", year="2021", howpublished="\url{https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html}", note=[Accessed: 12-June-2026]}

BibLaTeX

@online{reference.wolfram_2026_findisomorphicsubgraph, organization={Wolfram Research}, title={FindIsomorphicSubgraph}, year={2021}, url={https://reference.wolfram.com/language/ref/FindIsomorphicSubgraph.html}, note=[Accessed: 12-June-2026]}