Critical injective chromatic graphs
by Anjaly Kishore; M.S. Sunitha
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 5, 2017

Abstract: The concept of critical injective chromatic graph is introduced. Some properties of critical injective chromatic graph are studied based on number of vertices and degree of graphs. The condition for cycles to be critical injective chromatic is obtained. The existence of a critical injective chromatic graph is established. An algorithm for injective colouring of vertices of a given connected graph is proposed. An application of injective chromatic number and injective chromatic sum in the diagnosis of diseases based on symptoms is suggested.

Online publication date: Tue, 14-Nov-2017

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 Computing Science and Mathematics (IJCSM):
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