Title: The adjacent strong edge chromatic number of P₄ ∨ K_m,n and C₅ ∨ K_m,n

Authors: Zongjian Sun; Jing Chen; Qian 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. ' Library, 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.2012.047742

International Journal of Modelling, Identification and Control, 2012 Vol.16 No.3, pp.297 - 300

Published online: 17 Dec 2014 *

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