The palette index of Sierpiński triangle graphs and Sierpiński graphs A. Ghazaryan
Material type: ArticleContent type: Текст Media type: электронный Other title: Об индексе палитры треугольника Серпинского и графа Серпинского [Parallel title]Subject(s): индекс палитры графа | Серпинского треугольник | Серпинского графGenre/Form: статьи в журналах Online resources: Click here to access online In: Прикладная дискретная математика № 54. С. 99-108Abstract: 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.Библиогр.: 17 назв.
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.
There are no comments on this title.