Title: The adjacent strong edge chromatic number of P₁ ∨ K_m,n C₂ ∨ K_m,n

Authors: Zongjian Sun, Jing Chen

Addresses: College of Sciences, Hebei University of Science and Technology, Shijiazhuang, Hebei, 050018, China. ' College of Polytechnic, Hebei University of Science and Technology, Shijiazhuang, Hebei, 050018, China

Abstract: An algorithm is designed to search for the k-adjacent strong edge colouring of certain join graphs. Therefore, the adjacent strong edge chromatic number of two join graphs is obtained.

Keywords: k-adjacent strong edge colouring; adjacent strong edge chromatic number; complete bipartite graph; join graphs; identification.

DOI: 10.1504/IJMIC.2011.041312

International Journal of Modelling, Identification and Control, 2011 Vol.13 No.3, pp.221 - 224

Published online: 21 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article