IsomorphicSubgraphQ
IsomorphicSubgraphQ[g1,g2]
yields True if the graph g1 is isomorphic to a subgraph of the graph g2.
Details
- IsomorphicSubgraphQ is also known as subgraph isomorphism decision problem.
- IsomorphicSubgraphQ is typically used to determine whether a graph has substructure similar to another graph.
- IsomorphicSubgraphQ[g1,g2] gives True if g1 is equal to a subgraph of g2 after renaming vertices, and False otherwise.
Examples
open allclose allBasic Examples (1)
Scope (5)
IsomorphicSubgraphQ works with undirected graphs:
IsomorphicSubgraphQ gives False for non-isomorphic graphs:
It also gives False for non-graph expressions:
Applications (1)
Properties & Relations (2)
Use FindSubgraphIsomorphism to find a subgraph isomorphism:
Use FindIsomorphicSubgraph to find a subgraph that is isomorphic to a graph:
Text
Wolfram Research (2021), IsomorphicSubgraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/IsomorphicSubgraphQ.html.
CMS
Wolfram Language. 2021. "IsomorphicSubgraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/IsomorphicSubgraphQ.html.
APA
Wolfram Language. (2021). IsomorphicSubgraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/IsomorphicSubgraphQ.html