UndirectedEdge

UndirectedEdge(a, b)

is an undirected edge between the vertices a and b in a graph object.

See:

• Wikipedia - Directed graph
• Wikipedia - Graph theory

Examples

>> Graph({1 <-> 2, 2 <-> 3, 1 <-> 3, 4 <-> 2})

Related terms

DirectedEdge, GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ