The chromaticity of the join of tree and null graph
The chromaticity of the graph G, which is join of the tree Tp and the null graph Oq , is studied. We prove that G is chromatically unique if and only if 1 < p < 3, 1 < q < 2; a graph H and Tp + Op-1 are x-equivalent if and only if H = Tp + Op-1, where Tp is a tree of order p; H and Tp +...
| Опубликовано в: : | Прикладная дискретная математика № 50. С. 93-101 |
|---|---|
| Главный автор: | |
| Формат: | Статья в журнале |
| Язык: | English |
| Предметы: | |
| Online-ссылка: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000791059 Перейти в каталог НБ ТГУ |