undirected graph

undirected graph

[¦ən·də‚rek·təd ′graf] (mathematics) A graph whose edges are not assigned directions.