|
GraphTheory[UnderlyingGraph]
|
|
Calling Sequence
|
|
UnderlyingGraph(G)
|
|
|
Description
|
|
|
•
|
The UnderlyingGraph command returns the underlying graph of a graph, i.e. dropping the directions of the arcs and the weights of the edges (or arcs).
|
|
•
|
Note that UnderlyingGraph(G) = Graph(Vertices(G), Neighbors(G)).
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
![G := Digraph({[1, 2], [2, 3], [3, 4], [4, 1]})](/support/helpjp/helpview.aspx?si=6121/file01884/math56.png)
|
|
| (1) |
|
>
|
|
|
![{[1, 2], [2, 3], [3, 4], [4, 1]}](/support/helpjp/helpview.aspx?si=6121/file01884/math66.png)
| (2) |
|
>
|
|
|
![[[2, 4], [1, 3], [2, 4], [1, 3]]](/support/helpjp/helpview.aspx?si=6121/file01884/math73.png)
| (3) |
|
>
|
|
|
>
|
|
|
| (4) |
|
>
|
|
|
![[[2, 4], [1, 3], [2, 4], [1, 3]]](/support/helpjp/helpview.aspx?si=6121/file01884/math91.png)
| (5) |
|
|
Download Help Document
Was this information helpful?
