UndirectedGraph

Available

`UndirectedGraph[g]` gives the graph with every edge undirected; the

Forms

UndirectedGraph[g]

UndirectedGraph[{v -> w, …}]

Verified examples{EdgeCount[UndirectedGraph[Graph[{1 -> 2, 2 -> 1}]]], EdgeCount[UndirectedGraph[Graph[{1 -> 2, 2 -> 3}]]]} → {1, 2}{VertexList[UndirectedGraph[Graph[{1 -> 2}]]], UndirectedGraphQ[UndirectedGraph[Graph[{1 -> 2}]]]} → {{1, 2}, True}

Run this on Qurak Search the reference

Topics

Graph Modifications - Conversion of Graphs
New In80 Alphabetical Listing - U
Summary Of New Features In143 - Graph Computation
Summary Of New Features In143 - Graph Computation

Related

DirectedGraph SimpleGraph DirectedGraphQ UndirectedGraphQ IndexGraph ReverseGraph EdgeAdd EdgeDelete EdgeTaggedGraph FindSpanningTree Graph GraphComplement

All 6300 functions · Use this from an MCP client