Word.ws English Dictionary

undirected graph

undirected graph noun: a graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

Noun

undirected graph (plural undirected graphs)

  1. A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
    Synonyms:
    graph
    Antonyms:
    directed graph

Synonyms of undirected graph

Antonyms

Forms of undirected graph

pluralundirected graphs

Questions about undirected graph

What does undirected graph mean?
Undirected graph means a graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
What part of speech is undirected graph?
Undirected graph is a noun.
What is the plural of undirected graph?
The plural of undirected graph is undirected graphs.

Words near undirected graph in the dictionary

  1. undips
  2. undipt
  3. undirect
  4. undirectable
  5. undirected
  6. undirected graph
  7. undirected graphs
  8. undirected path
  9. undirected paths
  10. undirectedly
  11. undirectedness

Source and license

Adapted from Wiktionary: undirected graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “undirected graph.” Word.ws, https://word.ws/undirected_graph. Based on Wiktionary, CC BY-SA 4.0.