Colored distance

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

Colored distanceраскрашенное расстояние.

The colored distance of a colored graph \,G is introduced as the sum of distances between all unordered pairs of vertices having different colors. The chromatic distance of \,G, denoted by \,d_{ind}(G), is the minimum colored distance of a proper coloring of the vertex set.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.