On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
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 s...
| Main Authors: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
EDP Sciences
2016-01-01
|
| Colecção: | MATEC Web of Conferences |
| Acesso em linha: | http://dx.doi.org/10.1051/matecconf/20164402033 |