Graph Theory

Regular Graph A graph is said to be regular if every node has the same degree. Fig: Regular graph Planar Graph A planar graph is a graph that can be …

Bipartite Graph A bipartite graph is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in …

Adjacency Matrix An adjacency matrix is a sequence matrix used to represent a finite graph. It is a 2D array of size V X V matrix where V is the …

Subgraph A graph G1 = (V1,E1) is said to be a subgraph of a graph G2 = (V2, E2) if V1 is a subset of V2 and E1 is a …

Isomorphism If G1 = (V1, E1) and G2 = (V2, E2) are two graphs, then G1 is isomorphic to G2 iff (if and only if) there exists a bijection. Bijection …

Line Graph A line graph is a graph that seems to be a line in the eye view.  Line graphs are used to track changes over short and long periods of time. …

Complete Graph A complete graph is a graph that has an edge between every two vertices. If vertices is n, then edges = n(n-1)/2. Example, vertices = 5; then edges …

Graph Graph is a bunch of dots and lines where the lines connect some pairs of dots. These dots are called nodes or vertices and these lines are called edges. …