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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Modelling, Identification and Control
Paper Title
Journal
Date
