Understanding Dipartite Graphs: Definition and Examples

Dipartite refers to a graph that has two disjoint (non-overlapping) sets of vertices, such that every edge connects a vertex in one set to a vertex in the other set. In other words, there are no edges that connect vertices within the same set.

For example, a graph with two disjoint cliques (i.e., two disjoint sets of vertices that are all connected to each other) is a dipartite graph.

I like this

I dislike this

Report a content error

Share

Report a content error

Thank you! Your form was successfully submitted.

We apologize! Your form could not be submitted. Please try again later.

Submit reports

Share

• 
• 
• 
• 
• 
• 
• 
• 
•