Chromates, decompositions

The subsets Vg are called colour classes. The simplest descriptor that can be defined by a vertex chromatic decomposition is called the chromatic number k((7) [or vertex chromatic number, k((7)] and is the smallest number of colour equivalence classes (i.e. G). In general, there is not a unique chromatic decomposition of a graph with the smallest number of colours. Analogously, the descriptor obtained by an edge chromatic decomposition is called the edge chromatic number k(. ... 

The chromatic information index (or vertex chromatic information index) [Mow-showitz, 1968d] is the minimum value of the mean information content of all possible vertex chromatic decompositions with a number of colours equal to the vertex chromatic number and is defined as ... 

Graphs whose vertices or edges are symbolically differentiated by assigning a minimal number of different colours to the vertices (or edges) of G such that no two adjacent vertices (or edges) have the same colour (- chromatic decomposition). 

Verloop parameters Sterimol parameters Verloop Sterimol parameters Sterimol parameters vertex adjacency matrix adjacency matrix vertex centric indices - centric indices vertex chromatic decomposition chromatic decomposition... 

---