AVD Proper Edge-Coloring of some Cycle Related Graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Ikonion Journal of Mathematics
Volume: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 : 58 | Download : 10

Publication Date : 2021-10-10

Article Type : Research Paper

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,

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.