[Next] [Prev] [Right] [Left] [Up] [Index] [Root]
Elementary Invariants of a Graph

Elementary Invariants of a Graph

Edges(G) : Grph -> { Edge }
A set E whose elements are the edges of the graph G. Note that this creates a standard set and not the edge-set of G, in contrast to the function EdgeSet.
Order(G) : Grph -> RngIntElt
The number of vertices p of the (p, q) graph G.
Size(G) : Grph -> RngIntElt
The number of edges q of the (p, q) graph G.
Vertices(G) : Grph -> { Vert }
A set V whose elements are the vertices of the graph G. In contrast to the function VertexSet, this function returns the collection of vertices of G in the form of a standard set.
[Next] [Prev] [Right] [Left] [Up] [Index] [Root]