Graph:

It is the process of representing the link between the two or more  objects. Graph is the abstract notation.

Representation of graph:

Graph has two option:

1: Vertex

2: Edges

vertex:

vertex is define as:

it is the one or more object or point where two or more line or no. of edges meet with these points or object. vertex also called Nodes.

Edges:

edges is define as:

The line which meet or connect one or mode object with each other is called edges.

Example of vertex and edges:

G(V,E)

Example of graph( vertex and edges )


Order of graph:

All the number of vertex in graph is called order of the graph.

From the above example:

Order of the graph = 4


Size of the graph:

All the number of the edges in the graph is called size of the graph.

From the above example:

Size of the graph = 4


Directed graph:

The graph in which edges give direction toward the object or nodes is called directed graph.

Example:

Directed graph



Undirected graph:

The graph in which edges do not show direction toward the object or nodes is called undirected graph.

Example:

Undirected graph



Types of the graph:

There are many types of the graph which are given below:


1: Finite graph:

The graph which have limitation on edges and graph is called finite graph. we can also say the graph in which we can count no. of edges and no. of vertex is called finite graph.

Finite graph


2: Infinite graph:

The graph which do not have limitation on edges and graph is called finite graph. we can also say the graph in which we can not count no. of edges and no. of vertex is called finite graph.

Example:



Undirected graph

Trivial Graph :

The graph which have only one vertex of graph which show only one graph is called trivial graph.

Example:

Trivial Graph


Simple Graph:

The graph which do not have any loop or do not repeat the edges is called simple graph.

Example:

Simple Graph


Multi Graph:

The graph which do not have any self loop and have multi edges is called multi graph.

Example:

Multi Graph


Pseudo Graph:

The graph which  have any self loop and have multi edges is called multi graph.

Example:

Pseudo Graph


Null Graph:

The graph which have "n" no. of vertex but number of edges is zero is called null graph.

Example:

Null Graph


Complete Graph:

The graph in which one vertex is connected with all other vertex of the graph is called complete graph.

Example:

Complete Graph


Cyclic Graph:

the graph which have three vertices and also make a cyclic path is called cyclic graph.

Example:

Cyclic Graph



Application of graph:

There are many application of graph which are given below:

Graph use in Mathematics

Graph use in biology

Graph use in Algorithm

Graph use in chemistry

Graph use in google map

Graph use in social web app