IJPAM: Volume 105, No. 1 (2015)

ADJACENT VERTEX-DISTINGUISHING TOTAL
COLORING OF GENERAL MYCIELSKI OF $P_n$ AND $C_n$

Zhao Chuancheng$^1$, Ren Zhiguo$^2$, Liu Jun$^3$, Da Wenjiao$^4$, Yue Qiuju$^5$
$^{1,2,3,4,5}$Lanzhou City University
Lanzhou 730070, P.R. CHINA


Abstract. In this paper, we obtain the adjacent strong edge chromatic numbers of some General Mycielski $M_n(G)$ ($n\geq1$) of special graphs $G$.

Received: August 7, 2015

AMS Subject Classification: 05C15

Key Words and Phrases: graph, general Mycielski graph, adjacent strong edge coloring

Download paper from here.




DOI: 10.12732/ijpam.v105i1.8 How to cite this paper?

Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2015
Volume: 105
Issue: 1
Pages: 87 - 96


$P_n$ AND $C_n$%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).