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

Online Help

All Products    Maple    MapleSim


Hypergraphs

  

NumberOfVertices

  

Return the number of vertices of an hypergraph

 

Calling Sequence

Parameters

Description

Examples

References

Compatibility

Calling Sequence

NumberOfVertices(H)

Parameters

H

-

Hypergraph

Description

• 

The command NumberOfVertices(H) returns the number  of the vertices of H.

Terminology

• 

Hypergraph : mathematically, a hypergraph is a pair (X, Y) where X  is a finite set and Y is a set of non-empty subsets of X.

• 

Vertices : the members of X are called the vertices of the hypergraph (X, Y).

• 

Hyperedges : the members of Y are called the hyperedges (or simply edges) of  the hypergraph (X, Y).

Examples

withHypergraphs:

Create a hypergraph from its vertices and edges.

HHypergraph1,2,3,4,5,6,7,1,2,3,2,3,4,3,5,6

H< a hypergraph on 7 vertices with 4 hyperedges >

(1)

Print its vertices and edges.

VerticesH&semi;HyperedgesH

1&comma;2&comma;3&comma;4&comma;5&comma;6&comma;7

4&comma;2&comma;3&comma;1&comma;2&comma;3&comma;3&comma;5&comma;6

(2)

Print the numbers of its vertices and hyperedges.

NumberOfVerticesH&semi;NumberOfHyperedgesH

7

4

(3)

Draw a graphical representation of this hypergraph.

DrawH

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

HHypergraph1&comma;2&comma;3&comma;4&comma;5&comma;6&comma;7&comma;8&comma;6&comma;7&comma;52

H< a hypergraph on 7 vertices with 4 hyperedges >

(4)

Print its vertices and edges.

VerticesH&semi;HyperedgesH

1&comma;2&comma;3&comma;4&comma;5&comma;6&comma;7

4&comma;2&comma;3&comma;1&comma;2&comma;3&comma;3&comma;5&comma;6

(5)

Print the numbers of its vertices and hyperedges.

NumberOfVerticesH&semi;NumberOfHyperedgesH

7

4

(6)

Draw a graphical representation of this hypergraph.

DrawH

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[NumberOfVertices] command was introduced in Maple 2024.

• 

For more information on Maple 2024 changes, see Updates in Maple 2024.

See Also

Hypergraphs[AddHyperedges]

Hypergraphs[AddVertices]

Hypergraphs[DualHypergraph]

Hypergraphs[Hyperedges]

Hypergraphs[Hypergraph]

Hypergraphs[IsEdge]

Hypergraphs[NumberOfHyperedges]

Hypergraphs[NumberOfVertices]

Hypergraphs[PartialHypergraph]

Hypergraphs[SubHypergraph]

Hypergraphs[VertexEdgeIncidenceGraph]

Hypergraphs[Vertices]