Some Results on Palette Index of Cartesian Product Graphs
Given a proper edge coloring α of a graph G, we define the palette SG(ν, α) of a vertex ν ∈ V (G) as the set of all colors appearing on edges incident to ν. The palette index š(G) of G is the minimum number of distinct palettes occurring in a proper edge coloring of G. The windmill graph Wd(n, k) is...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gitutyun
2021-12-01
|
| Series: | Mathematical Problems of Computer Science |
| Subjects: | |
| Online Access: | http://mpcs.sci.am/index.php/mpcs/article/view/649 |