GraphTheory
EdgeMultiplicity
return edge multiplicity
IsMultigraph
test if graph is multigraph
Calling Sequence
Parameters
Description
Examples
Compatibility
EdgeMultiplicity(G, e)
EdgeMultiplicity(G)
IsMultigraph(G)
G
-
graph
e
list or set of vertices; edge of graph
EdgeMultiplicity(G, e) returns the edge multiplicity of e in G. This a nonnegative integer indicating the number of times the edge e appears in G.
EdgeMultiplicity(G) returns the edge multiplicity matrix of G. This a square matrix A where Ai,j is the number of edges from vertex i to vertex j in the graph G.
IsMultigraph(G) returns true if G is a multigraph.
with⁡GraphTheory:
G1≔Graph⁡5,Trail⁡1,2,3,4,3
G1≔Graph 1: an undirected multigraph with 5 vertices and 4 edge(s)
EdgeMultiplicity⁡G1,3,4
2
IsMultigraph⁡G1
true
G2≔Graph⁡5,1,2,2,3,2,4,3,5
G2≔Graph 2: an undirected graph with 5 vertices and 4 edge(s)
EdgeMultiplicity⁡G2,1,2
1
IsMultigraph⁡G2
false
The GraphTheory[EdgeMultiplicity] and GraphTheory[IsMultigraph] commands were introduced in Maple 2023.
For more information on Maple 2023 changes, see Updates in Maple 2023.
See Also
IsDirected
Download Help Document