Definition Undirected Graph A graph is called undirected if every edge is an unordered pair over the vertices, i.e.,