Let $G$ be a connected graph of order $3$ or more and $c:E(G)\rightarrow\mathbb{Z}_k$ ($k\ge 2$) a $k$-edge coloring of $G$ where adjacent edges may be colored the same. The color sum $s(v)$ of a vertex $v$ of $G$ is the sum in $\mathbb{Z}_k$ of the colors of the edges incident with $v.$ The $k$-edge coloring $c$ is a modular $k$-edge coloring of $G$ if $s(u)\ne s(v)$ in $\mathbb{Z}_k$ for all pairs $u,$ $v$ of adjacent vertices of $G.$ The modular chromatic index $\chi'_m(G)$ of $G$ is the minimum $k$ for which $G$ has a modular $k$-edge coloring. The Mycielskian of $G\,=\,(V,E)$ is the graph $\mathscr{M}(G)$ with vertex set $V\cup V'\cup\{u\},$ where $V'=\{v':v\in V\},$ and edge set $E\cup\{xy':xy\in E\}\cup\{v'u:v'\in V'\}.$ It is shown that $\chi'_m(\mathscr{M}(G))\,=\,\chi(\mathscr{M}(G))$ for some bipartite graphs, cycles and complete graphs.
Paramaguru, N., & Sampathkumar, R. (2015). Modular edge colorings of Mycielskian graphs. Transactions on Combinatorics, 4(3), 53-61. doi: 10.22108/toc.2015.7309
MLA
N. Paramaguru; R. Sampathkumar. "Modular edge colorings of Mycielskian graphs". Transactions on Combinatorics, 4, 3, 2015, 53-61. doi: 10.22108/toc.2015.7309
HARVARD
Paramaguru, N., Sampathkumar, R. (2015). 'Modular edge colorings of Mycielskian graphs', Transactions on Combinatorics, 4(3), pp. 53-61. doi: 10.22108/toc.2015.7309
VANCOUVER
Paramaguru, N., Sampathkumar, R. Modular edge colorings of Mycielskian graphs. Transactions on Combinatorics, 2015; 4(3): 53-61. doi: 10.22108/toc.2015.7309
)
