|
|
Definition of Undirected graph
1. Noun. (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a). ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Undirected Graph
Other Resources:
|
|
1. Noun. (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a). ¹
¹ Source: wiktionary.com