Chromatic Polynomial of Domination Subdivision Non Stable Graphs
A. Elakkiya1, M. Yamuna2
1A. Elakkiya*, School of Advanced Sciences, Vellore Institute of Technology, Vellore, India.
2M. Yamuna, School of Advanced Sciences, Vellore Institute of Technology, Vellore, India.
Manuscript received on September 16, 2019. | Revised Manuscript received on 24 September, 2019. | Manuscript published on October 10, 2019. | PP: 3027-3033 | Volume-8 Issue-12, October 2019. | Retrieval Number: K24020981119/2019©BEIESP | DOI: 10.35940/ijitee.K2402.1081219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A graph G is said to be domination subdivision non stable ( DSNS ) if ( Gsduv ) = ( G ) + 1 for all u, v V ( G ), u adjacent to v. In this paper, we provide a method of determining the chromatic polynomial of DSNS graph from G.
Keywords: Chromatic Polynomial, Complement of a Graph, Edge Contraction.
Scope of the Article: Cryptography and Applied Mathematics