- Ikonion Journal of Mathematics
- Vol: 3 Issue: 2
- AVD Proper Edge-Coloring of some Cycle Related Graphs
AVD Proper Edge-Coloring of some Cycle Related Graphs
Authors : J Naveen
Pages : 27-42
Doi:10.54286/ikjm.972238
View : 9 | Download : 4
Publication Date : 2021-10-10
Article Type : Research
Abstract :The adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for a proper edge-coloring of G, in which no two adjacent vertices are incident to edges colored with the same set of colors. The minimum number of colors required for an adjacent vertex-distinguishing proper edge-coloring of G is called the adjacent vertex-distinguishing proper edge-chromatic index. In this paper, I compute adjacent vertex-distinguishing proper edge-chromatic index of Anti-prism, sunflower graph, double sunflower graph, triangular winged prism, rectangular winged prism and Polygonal snake graph.Keywords : Edge coloring, AVD proper edge-coloring, cycle,