Kaleidoscopical graphs and semigroups

Author K. D. Protasova
islab@unicyb.kiev.ua
Kyiv National University

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
Reference 1. T. Banakh, O. Petrenko, I. Protasov, S. Slobodianuk, Kaleidoscopical configurations in G-space, preprint.

 2. I. Protasov, T. Banakh, Ball Structures and Colorings of Groups and Graphs, Math. Stud. Monogr. Ser. V.11, VNTL Publisher, Lviv, 2003.

 3. I.V. Protasov, K.D. Protasova, Kaleidoscopical graphs and Hamming codes, in Voronoi’s Impact on Modern Science, Institute Mathematics, NAS Ukraine, Kiev 2008, book 4, V.1, 240–245.

 4. K.D. Protasova, Kaleidoscopical graphs, Mat. Stud. 18 (2002), ¹1, 3–9.
Pages 3-5
Volume 36
Issue 1
Year 2011
Journal Matematychni Studii
Full text of paper PDF
Table of content of issue HTML