Undirected-graph definition

(graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
noun
0
0
Advertisement

Other Word Forms

Noun

Singular:
undirected-graph
Plural:
undirected-graphs