Posted inGraph Theory & Applications
Graph Theory – Coloring
Graph coloring is nothing but a simple way of labelling graph components such as vertices,…
Posted inGraph Theory & Applications
Graph Theory – Independent Sets
Independent sets are represented in sets, in which · there should not be any edges adjacent to…
Posted inGraph Theory & Applications
Graph Theory – Matchings
A matching graph is a subgraph of a graph where there are no edges adjacent…
Posted inGraph Theory & Applications
Cut Set and Cut Vertex of Graph
Whether it is possible to traverse a graph from one vertex to another is determined…
Posted inGraph Theory & Applications
Graph Theory – Coverings
A covering graph is a subgraph which contains either all the vertices or all the…
Posted inGraph Theory & Applications
Graph Theory – Connectivity
Whether it is possible to traverse a graph from one vertex to another is determined…
Posted inGraph Theory & Applications
Graph Theory – Trees
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure…
Posted inGraph Theory & Applications
Graph Theory – Types of Graphs
There are various types of graphs depending upon the number of vertices, number of edges,…
Posted inDesign & Analysis of Algorithms
Maximum Matching in Bipartite Graphs
In many situations we are faced with a problem of pairing elements of two sets.…
Posted inDesign & Analysis of Algorithms
The Simplex Method
We have already encountered linear programming (see Section 6.6)—the general problem of optimizing a linear…