In arithmetic, graph theory is the investigation of graphs, which are scientific structures used to show pairwise relations between objects. A graph in this setting is comprised of vertices (additionally called hubs or focuses) which are associated by edges (likewise called connections or lines). A qualification is made between undirected graphs, where edges connect two vertices evenly, and coordinated graphs, where edges interface two vertices unevenly; see Graph (discrete science) for increasingly point by point definitions and for different varieties in the sorts of graph that are usually thought of. Graphs are one of the prime objects of study in discrete arithmetic.

A graph 'G' is a lot of vertex, called hubs 'v' which are associated by edges, called joins 'e'. In this way G= (v , e).

Vertex (Node): A hub v is a convergence purpose of a graph. It signifies an area, for example, a city, a street crossing point, or a vehicle terminal (stations, harbors, and air terminals).

Edge (Link): An edge e is a connection between two hubs. A connection signifies developments between hubs. It has a course that is commonly spoken to as a bolt. On the off chance that a bolt isn't utilized, it implies the connection is bi-directional.