Bipartite Graphs

Bipartite Graph - If the vertex-set of a graph G can be split into two disjoint sets, V₁ and V₂ , in such a way that each edge in the graph joins a vertex in V₁ to a vertex in V₂ , and there are no edges in G that connect two vertices in V₁ or two vertices in V₂ , then the graph G is called a bipartite graph.

Complete Bipartite Graph - A complete bipartite graph is a bipartite graph in which each vertex in the first set is joined to every single vertex in the second set. The complete bipartite graph is denoted by K_x,y where the graph G contains x vertices in the first set and y vertices in the second set.

Mahesh Parahar

Updated on 23-Aug-2019 06:27:37

• Related Questions & Answers
• What are the applications of Bipartite graphs?
• C++ Program to Perform Graph Coloring on Bipartite Graphs
• Maximum Bipartite Matching
• Eulerian Graphs
• Planar Graphs
• Hamiltonian Graphs
• Strongly Connected Graphs
• Representation of Graphs
• Basic Concepts of Graphs
• Connected vs Disconnected Graphs
• Matrix Representation of Graphs
• How to find if a graph is Bipartite?
• Planar Graphs and their Properties
• Graphs and its traversal algorithms
• Isomorphism and Homeomorphism of graphs