- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Bipartite Graphs

**Bipartite Graph** - If the vertex-set of a graph G can be split into two disjoint sets, V_{1} and V_{2} , in such a way that each edge in the graph joins a vertex in V_{1} to a vertex in V_{2} , and there are no edges in G that connect two vertices in V_{1} or two vertices in V_{2} , 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.

- Related Articles
- What are the applications of Bipartite graphs?
- C++ Program to Perform Graph Coloring on Bipartite Graphs
- Maximum Bipartite Matching
- Eulerian Graphs
- Hamiltonian Graphs
- Planar Graphs
- How to find if a graph is Bipartite?
- Representation of Graphs
- Strongly Connected Graphs
- Speed Time Graphs
- Maximum number of edges in Bipartite graph in C++
- Matrix Representation of Graphs
- Basic Concepts of Graphs
- Connected vs Disconnected Graphs
- What are Bar graphs?

Advertisements