Admin

Helpdice Team

30 May, 2024

A graph is said to be ___________ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.