Adjacent vertex distinguishing edge coloring of brick-product of 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:1
Adjacent vertex distinguishing edge coloring of brick-product of graphs

Adjacent vertex distinguishing edge coloring of brick-product of graphs

Authors : Anantharaman S

Pages : 1-14

View : 73 | Download : 10

Publication Date : 2021-06-02

Article Type : Research Paper

Abstract :The graph $G$ to be a finite, simple, undirected and connected. An edge coloring of a graph $G$ is an assignment of colors of $G,$ one color to each edge. If adjacent edges are assigned distinct colors, then the edge coloring is a proper edge coloring. The adjacent vertex distinguishing proper edge coloring is the minimum number of colors required for a proper edge coloring of a graph $G$ such that adjacent vertices are distinguished by their color sets insert ignore into journalissuearticles values(colors of edges that are incident to them);. The minimum number of colors required for an adjacent vertex distinguishing proper edge coloring of a graph is called the adjacent vertex distinguishing chromatic index. In this paper, I am computing adjacent vertex distinguishing chromatic index of brick-product of graphs.
Keywords : Edge coloring, Adjacent vertex distinguishing chromatic index, Brick product

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.