Overview of the Hypergraphs Package
DescriptionList of Hypergraphs Package CommandsList of Commands in the ExampleHypergraphs SubpackageReferencesCompatibility
<Text-field style="Heading 2" layout="Heading 2" bookmark="info">Description</Text-field>
The Hypergraphs package is a collection of commands for manipulating hypergraphs.
All hypergraphs of this package are undirected, thus they are a generalization of undirected graphs, where any edge (then called a hyperedge) can have more than two elements.
Hypergraphs arise naturally in many areas of science. Some operations on hypergraphs, such as the computation of transversal hypergraph, are used in machine learning, indexing of databases, data mining, to name a few application areas.
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk0">List of Hypergraphs Package Commands</Text-field>
Below is a list of all commands in the Hypergraphs package.AddHyperedgesAddVerticesAntiRankAreEqualAreIsomorphicComplementHypergraphDegreeProfileDrawDualHypergraphHyperedgesHypergraphIsConnectedIsEdgeIsLinearIsRegularIsUniformLineGraphMaxMinNumberOfHyperedgesNumberOfVerticesPartialHypergraphRankSubHypergraphTransversalVertexEdgeIncidenceGraphVertices
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk1">List of Commands in the ExampleHypergraphs Subpackage</Text-field>
The Hypergraphs package has one subpackage. It is called ExampleHypergraphs. It contains the following commands.FanKuratowskiLovaszNonEmptyPowerSetRandomHypergraph
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk2">References</Text-field>
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.
<Text-field style="Heading 2" layout="Heading 2" bookmark="compatibility">Compatibility</Text-field>
The Hypergraphs package was introduced in Maple 2024.
For more information on Maple 2024 changes, see Updates in Maple 2024.See AlsoHypergraphs[AddHyperedges]Hypergraphs[AddVertices]Hypergraphs[AntiRank]Hypergraphs[AreEqual]Hypergraphs[AreIsomorphic]Hypergraphs[ComplementHypergraph]Hypergraphs[DegreeProfile]Hypergraphs[Draw]Hypergraphs[DualHypergraph]Hypergraphs[ExampleHypergraphs]Hypergraphs[Hyperedges]Hypergraphs[Hypergraph]Hypergraphs[IsConnected]Hypergraphs[IsEdge]Hypergraphs[IsLinear]Hypergraphs[IsRegular]Hypergraphs[IsUniform]Hypergraphs[LineGraph]Hypergraphs[Max]Hypergraphs[Min]Hypergraphs[NumberOfHyperedges]Hypergraphs[NumberOfVertices]Hypergraphs[PartialHypergraph]Hypergraphs[Rank]Hypergraphs[SubHypergraph]Hypergraphs[Transversal]Hypergraphs[VertexEdgeIncidenceGraph]Hypergraphs[Vertices]