Share Your Research, Maximize Your Social Impacts
Kaleidoscopical graphs and semigroups
Journal: Matematychni Studii (Vol.36, No. 1)Publication Date: 2011-07-01
Authors : Protasova K. D.;
Page : 3-5
Keywords : graphs; semigroups;
Source : Download
Find it from : Google Scholar
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.
Other Latest Articles
- Extending pairs of metrics
- Decomposition semi-continuous functions into sum of quasi-continuous functions and the oscillation of almost continuous functions (in Ukrainian)
- On normality of spaces of scatteredly continuous maps
- Operator analogue of Bertrand’s test (in Ukrainian)
- Almost antiproximinal sets in $L_1$
Last modified: 2014-01-13 19:59:12