Computation of Pseudocoloring of Graphs through Python
V. Yegnanarayanan1, S. B. Pravallika2, Mokkala Mounika3
1V. Yegnanarayanan*, School of Arts, Science and Humanities, Sastra Deemed to be University, Thanjavur, Tamil Nadu.
2S.B. Pravallika, School of Computing, Sastra Deemed to be University, Thanjavur, Tamil Nadu, India.
3Mokkala Mounika, School of Computing, Sastra Deemed to be University, Thanjavur, Tamil Nadu, India.
Manuscript received on October 18, 2019. | Revised Manuscript received on 24 October, 2019. | Manuscript published on November 10, 2019. | PP: 686-690 | Volume-9 Issue-1, November 2019. | Retrieval Number: A4587119119/2019©BEIESP | DOI: 10.35940/ijitee.A3912.119119
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: In the task of coloring the vertices of a simple graph G one come across innumerable number of challenges. There are various graph coloring parameters available in the literature. The concept of pseudo coloring is quite interesting. In this type of coloring, we can allot same color to the adjacent vertices. The maximum number of colors used in a pseudocoloring where for any two distinct colors, one can always find at least one edge between them is called pseudo achromatic number, ѱ(G) of G. In the paper we determine this coloring parameter for some classes of graphs through python code.
Keywords: Graphs, Pseudocoloring, Pseudo Achromatic Number.
Scope of the Article: Graph Algorithms and Graph Drawing