Euler graphs!!!

In graph theory we deals with different types of graphs.One such graph that we commonly seen in many real world problems is in the form of Euler circuit.

An Euler circiut is a cycle of undirected graphs,that traverses through each edge in the graph exactly once and ends at the starting node itself.Euler proved that the necessary condition for the existence of Eulerian circuits is that the connected graphs doesn't contain any nodes of odd degree.

Graph theory!!!

Graph theory is a prime study area comming under discrete mathematics.This is mainly used to solve a wide range of practical problems in our day to day life dealing with both natural & manmade structures.Here the entities are represented by means of points and the  relations or connections are denoted by using line segments.Several segments meets at a point forming nodes or vertices.

Graphs can be directed or undirected.In directed graph (digraph)the direction of the  flow of entities is shown with the help of arrows and in undirected graph there is no such notations.Also its possible to give weights to each segments depending upon the revelence of each segment with respect to other and is called as weighted graphs.