The adjacent strong edge chromatic number of P₁ ∨ K_m,n C₂ ∨ K_m,n
by Zongjian Sun, Jing Chen
International Journal of Modelling, Identification and Control (IJMIC), Vol. 13, No. 3, 2011

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.

Online publication date: Sat, 21-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com