Multipartite graph
Tripartite graphs and networks
 | This article, Multipartite graph, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
Tripartite graphs and networks
In a tripartite graph, the vertices are partitioned into three sets (called partitions) in such a way that no two vertices contained in any one partition are adjacent.
General Definition of k-partite graphs
A graph G is k-partite with vertex classes V1,V2,V3,…,Vk if V(G)=V1∪V2∪V3∪…∪Vk and Vi∩Vj=∅ whenever 1≤i<j≤k and no edge joins two vertices in the same class. (Bollobas). This means that the vertices of the graph can be partitioned in k independent sets, which are sometimes called the partite sets of the partition. The tripartite graphs are the special case of k-partite graphs when k is equal with 3.