determine if a subgraph isomorphism exists
isomorphism = truefalse
Specifies whether the isomorphism should be returned when it exists. In this case the result is an expression sequence consisting of true and a set of equations specifying a mapping from the vertices of G1 to those of G2.
IsSubgraphIsomorphic(G) accepts either two undirected graphs or two directed graphs as input. It returns true if G1 is isomorphic to some subgraph of G2.
If the graphs are weighted graphs, the edge weights are ignored.
An undirected graph example: C6 is isomorphic to a subgraph of K33 but not of K24.
C6 ≔ CycleGraph⁡6
C6≔Graph 1: an undirected graph with 6 vertices and 6 edge(s)
K24 ≔ CompleteGraph⁡2,4
K24≔Graph 2: an undirected graph with 6 vertices and 8 edge(s)
K33 ≔ CompleteGraph⁡3,3
K33≔Graph 3: an undirected graph with 6 vertices and 9 edge(s)
The GraphTheory[IsSubgraphIsomorphic] command was introduced in Maple 2021.
For more information on Maple 2021 changes, see Updates in Maple 2021.
The GraphTheory[IsSubgraphIsomorphic] command was updated in Maple 2022.
The isomorphism option was introduced in Maple 2022.
For more information on Maple 2022 changes, see Updates in Maple 2022.
Download Help Document
What kind of issue would you like to report? (Optional)