undirected graph

Noun

Meaning

undirected graph (plural undirected graphs)

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

Synonyms

Antonyms

Close letter words and terms