Ques : What is Vertex Colouring ?

, , No Comments

Definition: A vertex colouring of a graph G is an assignment of colours to vertices of G in such a way that no two adjacent vertices have the same colour. A graph is called k-vertex colourable if it has a vertex colouring of k colours. The minimum number of colours required to colour a graph G is called the vertex chromatic number of G, usually denoted as X (G).

0 टिप्पणियाँ:

Post a Comment