Achromatic status

Материал из WikiGrapp
Перейти к:навигация, поиск

Achromatic statusахроматический статус.

Let \,G be a connected graph with its achromatic number \,\psi(G) =k. The achromatic status \sum \psi(G) is the minimum value of the total status for a set \,X of \,k vertices each from a different set \,V_{i} in the partition of \,V, where minimum is taken over all possible partitions of \,V that satisfy (1) and (2) from the definition of achromatic number.