The Vertex-Distinguishing Edge Coloring of π‘·π’Žβ‹π‘²π’ and π‘ͺπ’Ž ∨ 𝑲𝒏

Chuan-cheng ZHAO, Shu-xia YAO, Liu JUN

Abstract


A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different, and the number of edges in any two color classes differ by at most one, which the required minimum number of colors are called the adjacent strong equitable edge chromatic number. In this paper, we obtain vertex-distinguishing edge coloring of π‘ƒπ‘š ∨ 𝐾𝑛 and πΆπ‘š ∨ 𝐾𝑛.

Keywords


Path, Cycle, Complete graph, Join-graph, Vertex-distinguishing edge chromatic number.


DOI
10.12783/dtetr/icamm2016/7350

Full Text:

PDF

Refbacks

  • There are currently no refbacks.