Undirected Graph

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise indicated by context, the term "graph" can usually be taken to mean "undirected graph."

A graph may made undirected in the Wolfram Language using the command UndirectedGraph[g] and may be tested to see if it is an undirected graph using UndirectedGraphQ[g].

See also

Degree Sequence, Directed Graph, Graph, Mixed Graph, Multigraph, Oriented Graph, Pseudograph, Simple Graph

Explore with Wolfram|Alpha


Skiena, S. "Undirected Graphs." §3.2.4 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 92-93, 1990.

Referenced on Wolfram|Alpha

Undirected Graph

Cite this as:

Weisstein, Eric W. "Undirected Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications