Dominator chromatic number of m-Splitting graph and m-Shadow graph of path graph
by T. Manjula; R. Rajeswari
International Journal of Biomedical Engineering and Technology (IJBET), Vol. 27, No. 1/2, 2018

Abstract: Graph theory techniques are applied to several biological domains. The application of graph colouring and domination in the field of biology and medicine includes identifying drug targets, determining the role of proteins, genes of unknown function. The area obtained by combining graph colouring and domination is called the dominator colouring of a graph. This is defined as proper colouring of vertices in which every vertex of the graph dominates all vertices of at least one colour class. The least number of colours required for a dominator colouring of a graph is called the dominator chromatic number. The dominator chromatic number and domination number are obtained for m-Splitting graph and m-Shadow graph of path graph and a relationship between them is expressed in this paper.

Online publication date: Mon, 09-Jul-2018

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 Biomedical Engineering and Technology (IJBET):
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