Undirected-graph Definition

noun

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

Wiktionary

Other Word Forms of Undirected-graph

Noun

Singular:
undirected-graph
Plural:
undirected-graphs

Related Articles

Undirected-graph Is Also Mentioned In

Find Similar Words

Find similar words to undirected-graph using the buttons below.

Words Starting With

UUNUND

Words Ending With

HPHAPH

Unscrambles

undirected-graph

Words Starting With U and Ending With H

Starts With U & Ends With HStarts With UN & Ends With HStarts With U & Ends With PH

Word Length