06091269

j

06091269 Liu, Shunqin Chen, Xiang'en The Smarandachely adjacent-vertex-distinguishing proper edge coloring of $\overline{K}_3\vee K_n$. J. Lanzhou Univ. Technol. 37, No. 1, 139-145 (2011). 2011 Editorial Department of Journal of Lanzhou University of Technology, Lanzhou ZH complete graphs Smarandachely adjacent-vertex-distinguishing proper edge coloring Smarandachely adjacent-vertex-distinguishing proper edge chromatic number Summary: A proper edge coloring of $G$ would be a Smarandachely adjacent vertex distinguishing edge coloring if for any two adjacent vertices $u$ and $v$, the set of colors appearing on the edges incident to $u$ and that appearing on the edges incident to $v$ are not included with each other. The smallest number of colors used for the Smarandachely adjacent-vertex-distinguishing proper edge coloring of $G$ exists is called the Smarandachely adjacent vertex distinguishing edge chromatic number, or SA-edge chromatic number for short, and denoted by $\chi'_{sa} (G)$. In this paper, the SA-edge chromatic number of $\overline{K}_3\vee K_n$ is discussed.