Kaleidoscopical graphs and semigroups
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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | German |
| Published: |
Ivan Franko National University of Lviv
2011-07-01
|
| Series: | Математичні Студії |
| Subjects: | |
| Online Access: | http://matstud.org.ua/texts/2011/36_1/3-5.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|