Noun: undirected graph
- In mathematics, a graph in which edges have no orientation
"In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path"
Derived forms: undirected graphs
Type of: graph, graphical record, graphical recording
Encyclopedia: Undirected graph