ON PALETTE INDEX OF UNICYCLE AND BICYCLE GRAPHS Aghasi Ghazaryan
Given a proper edge coloringφof a graphG, we define the paletteSG(v,φ)of a vertexv∈V(G)as the set of all colors appearing on edges incident withv.The palette index ˇs(G)ofGis the minimum number of distinct palettes occur-ring in a proper edge coloring ofG. In this paper we give an upper bound onthe palette index of a graphGin terms of cyclomatic numbercyc(G)ofGandmaximum degree∆(G)ofG. We also give a sharp upper bound for the paletteindex of unicycle and bicycle graphs.
DOI: 10.46991/PYSU:A/2019.53.1.003 Physical and Mathematical Sciences, 53(1 (248) 3-12
