AreIsomorphic - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Hypergraphs

 AreIsomorphic
 Check whether two hypergraphs are isomorphic or not

 Calling Sequence AreIsomorphic (H1,H2)

Parameters

 H1 - H2 -

Description

 • The command AreIsomorphic(H1,H2) checks whether the hypergraphs H1 and H2 are isomorphic or not.

Terminology

 • Isomorphic hypergraphs : Two hypergraphs H1 :=(X1, Y1) and H2 :=(X2, Y2) are said isomorphic whenever there exists a bijection f from X1 to X2 such that any non-empty subset x1 of X1  is a hyperedge of H1 if and only if f(x1)  is a hyperedge of H2.

Examples

 > $\mathrm{with}\left(\mathrm{Hypergraphs}\right):$

Create a hypergraph from its vertices and edges.

 > $H≔\mathrm{Hypergraph}\left(\left[1,2,3,4,5,6,7\right],\left[\left\{1,2,3\right\},\left\{2,3\right\},\left\{4\right\},\left\{3,5,6\right\}\right]\right)$
 ${H}{≔}{\mathrm{< a hypergraph on 7 vertices with 4 hyperedges >}}$ (1)

Print its vertices and edges.

 > $\mathrm{Vertices}\left(H\right);$$\mathrm{Hyperedges}\left(H\right)$
 $\left[{1}{,}{2}{,}{3}{,}{4}{,}{5}{,}{6}{,}{7}\right]$
 $\left[\left\{{4}\right\}{,}\left\{{2}{,}{3}\right\}{,}\left\{{1}{,}{2}{,}{3}\right\}{,}\left\{{3}{,}{5}{,}{6}\right\}\right]$ (2)

Draw a graphical representation of this hypergraph.

 > $\mathrm{Draw}\left(H\right)$

Create another hypergraph from its edges.

 > $H≔\mathrm{Hypergraph}\left(\left[\left\{1,2,3\right\},\left\{2,3\right\},\left\{4\right\},\left\{3,5,6\right\}\right]\right)$
 ${H}{≔}{\mathrm{< a hypergraph on 6 vertices with 4 hyperedges >}}$ (3)

Print its vertices and edges.

 > $\mathrm{Vertices}\left(H\right);$$\mathrm{Hyperedges}\left(H\right)$
 $\left[{1}{,}{2}{,}{3}{,}{4}{,}{5}{,}{6}\right]$
 $\left[\left\{{4}\right\}{,}\left\{{2}{,}{3}\right\}{,}\left\{{1}{,}{2}{,}{3}\right\}{,}\left\{{3}{,}{5}{,}{6}\right\}\right]$ (4)

Draw a graphical representation of this hypergraph.

 > $\mathrm{Draw}\left(H\right)$

Create a third hypergraph from its vertices and bit vector encdings of its edges.

 > $H≔\mathrm{Hypergraph}\left(\left[1,2,3,4,5,6,7\right],\left[8,6,7,52\right]\right)$
 ${H}{≔}{\mathrm{< a hypergraph on 7 vertices with 4 hyperedges >}}$ (5)

Print its vertices and edges.

 > $\mathrm{Vertices}\left(H\right);$$\mathrm{Hyperedges}\left(H\right)$
 $\left[{1}{,}{2}{,}{3}{,}{4}{,}{5}{,}{6}{,}{7}\right]$
 $\left[\left\{{4}\right\}{,}\left\{{2}{,}{3}\right\}{,}\left\{{1}{,}{2}{,}{3}\right\}{,}\left\{{3}{,}{5}{,}{6}\right\}\right]$ (6)

Draw a graphical representation of this hypergraph.

 > $\mathrm{Draw}\left(H\right)$

References

 Claude Berge. Hypergraphes. Combinatoires des ensembles finis. 1987,  Paris, Gauthier-Villars, translated to English.
 Claude Berge. Hypergraphs. Combinatorics of Finite Sets.  1989, Amsterdam, North-Holland Mathematical Library, Elsevier, translated from French.
 Charles Leiserson, Liyun Li, Marc Moreno Maza and Yuzhen Xie " Parallel computation of the minimal elements of a poset." Proceedings of the 4th International Workshop on Parallel Symbolic Computation (PASCO) 2010: 53-62, ACM.

Compatibility

 • The Hypergraphs[AreIsomorphic] command was introduced in Maple 2024.
 • For more information on Maple 2024 changes, see Updates in Maple 2024.