Some results on the palette index of graphs
CJ Casselgren, PA Petrosyan - Discrete Mathematics & …, 2019 - dmtcs.episciences.org
Given a proper edge coloring φ of a graph G, we define the palette S_G(v,φ) of a vertex
v∈V(G) as the set of all colors appearing on edges incident with v. The palette index ̌s(G) …
v∈V(G) as the set of all colors appearing on edges incident with v. The palette index ̌s(G) …
A family of multigraphs with large palette index
M Avesani, A Bonisoli, G Mazzuoccolo - ar** $\alpha: E (G)\longrightarrow\mathbb
{N} $ such that $\alpha (e)\not=\alpha (e') $ for every pair of adjacent edges $ e $ and $ e' …
{N} $ such that $\alpha (e)\not=\alpha (e') $ for every pair of adjacent edges $ e $ and $ e' …
ВЕСТНИК РОССИЙСКО-АРМЯНСКОГО (СЛАВЯНСКОГО) УНИВЕРСИТЕТА: ФИЗИКО-МАТЕМАТИЧЕСКИЕ И ЕСТЕСТВЕННЫЕ НАУКИ
J Hakobyan - ВЕСТНИК РОССИЙСКО-АРМЯНСКОГО … - elibrary.ru
A-partition of a graph is a surjection:()→{0, 1,…,-1}. A-partition (≥ 2) of a graph is a locally-
balanced with an open neighborhood if for every∈() and any 0≤<≤-1,||{∈():()=} …
balanced with an open neighborhood if for every∈() and any 0≤<≤-1,||{∈():()=} …
The palette index of Sierpiński triangle graphs and Sierpiński graphs
AB Ghazaryan - Прикладная дискретная математика, 2021 - mathnet.ru
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 …
to the edges which are incident to v. The palette index of G is the minimum number of …
[PDF][PDF] The palette index of Sierpiński triangle graphs and Sierpiński graphs
A Ghazaryan - 2021 - vital.lib.tsu.ru
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 …
to the edges which are incident to v. The palette index of G is the minimum number of …