The palette index of Sierpiński triangle graphs and Sierpiński graphs

Эндаумент фонд ТГУ!
Впиши своё имя в историю университета
- Сделать пожертвование -

Add to "Quick Collection"

Description	Size	Format
The palette index of Sierpinski triangle graphs and Sierpinski graphs	1 MB	Adobe Acrobat PDF	Read	Download
DOI Доступ к ресурсу на сайте издателя			10.17223/20710410/54/5

Title: The palette index of Sierpiński triangle graphs and Sierpiński graphs
Title: Об индексе палитры треугольника Серпинского и графа Серпинского
Creator: Ghazaryan, A.
Date: 2021
DOI: 10.17223/20710410/54/5
Description: The palette of a vertex v of a graph G in a proper edge coloring is the set of colors assigned to the edges which are incident to v. The palette index of G is the minimum number of palettes occurring among all proper edge colorings of G. In this paper, we consider the palette index of Sierpinski graphs S” and Sierpinski triangle graphs S” . In particular, we determine the exact value of the palette index of Sierpinski triangle graphs. We also determine the palette index of Sierpinski graphs S” where p is even, p = 3, or n = 2 and p = 41 + 3.

Created: 10-12-2021

555 Visitors

431 Hits

136 Downloads

Журналы ТГУ The palette index of Sierpiński triangle graphs and Sierpiński graphs