MATEC Web of Conferences
Volume 44, 20162016 International Conference on Electronic, Information and Computer Engineering
|Number of page(s)||5|
|Section||Electronics, Information and Engineering Application|
|Published online||08 March 2016|
On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
Lanzhou City University, School of Information Science and engineering, Lanzhou 730070, P.R. China
2 Lanzhou City University, Department of Mathematics, Lanzhou 730070, P.R. China
a authore-mail: 527876625@.qq.com
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 Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.