TYPES OF GRAPH | Data Structures Tutorial pdf

TYPES OF GRAPH

=> Undirected Graph-In undirected graph,there is no specification of directions with edges.Undirected graphs are also called unordered graphs.
=> Connected Graph-An undirected graph is said to be connected,if each vertex is reachable fromother vertex i.e. there exist a simple path between any two vertices.
=> Complete Graph-A graph is said to be complete graph if every node of graph is adjacent to all other nodes of graph.A complete graph of n nodes has n(n-1)/2 edges.
=> Tree Graph-A graph is said to be tree graph,If it is connected and there is one unique simple path between any two nodes of graph.
=> Labelled Graph-A graph Is said to be labelled graph,if all its edges e=[u,v] are asigned a name.
=> Multigrah Graph- A graph is said to be multigraph,if any of following conditions is met:-
1.Multiple edges-if two or more distict edges have same end points,they are called multiple edges.
2.loop-if an edge has same end point.
=> Strongly Connected Graph-A directed graph is sai to be strongly connected ,if each vertex is reachable from other vertex i.e. there exist a simple path between any two vertices.
=> Weighted Graph- A graph G is said be weighted graph,if all its edges e=[u,v] are assigned non-negative number called weight.weight of edge is also called as length of edge and denoted by W(e).