Definition Undirected Graph A graph G=(V,E) is called undirected if every edge is an unordered pair over the vertices, i.e., E⊆{{u,v}∣u,v∈V}.