Kaleidoscopical graphs and semigroups

Abstract

We give a semigroup characterization of kaleidoscopical graphs. A connected graph Г (considered as a metric space with the path metric) is called kaleidoscopical if there is a vertex coloring of Г which is bijective on each unit ball.

Keywords

• graphs
• semigroups