12.1 Definition and terminologies 1. Definition of graphs Graph=(v,e) V: nonempty finite vertice set E: edge set Undirected prapl oh If the tuple denoting an edge is unordered then (v1, v2)and(v2, vl)are the same edge12.1 Definition and terminologies 1. Definition of graphs: Graph=(V, E) V: nonempty finite vertice set E: edge set • Undirected praph: If the tuple denoting an edge is unordered, then (v1,v2) and (v2,v1) are the same edge