publication . Article . 2016

On the Adjacent Strong Equitable Edge Coloring ofPn∨Pn,Pn∨CnandCn∨Cn

Jun Liu; Chuan Cheng Zhao; Shu Xia Yao; Zhi Guo Ren; Qiu Ju Yue;
Open Access
  • Published: 01 Jan 2016 Journal: MATEC Web of Conferences, volume 44, page 2,033 (eissn: 2261-236X, Copyright policy)
  • Publisher: EDP Sciences
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 is called the adjacent strong equitable edge chromatic number. In this paper, we discuss the adjacent strong equitable edge coloring of join-graphs about P n ∨ P n , P n ∨ C n and C n ∨ C n .
Persistent Identifiers
arXiv: Computer Science::Discrete MathematicsMathematics::Combinatorics
free text keywords: Graph, Chemistry, Telecommunications, business.industry, business, Combinatorics, Colored, Edge coloring, Chromatic scale, Incident edge, Vertex (geometry), lcsh:Engineering (General). Civil engineering (General), lcsh:TA1-2040
Any information missing or wrong?Report an Issue