Signed graphs from proper coloring of graphs

• Divya Antoney ^[1] ; Tabitha Agnes Mangam ^[1] ; Mukti Acharya ^[1]
  1. [1] Christ University

     Christ University

     India

     
• Localización: 3c Tecnología: glosas de innovación aplicadas a la pyme, ISSN-e 2254-4143, Vol. 12, Nº. 2, 2023, págs. 148-161
• Idioma: inglés
• Enlaces
  • Texto Completo Ejemplar
• Resumen

  • Let χ(G) denote the chromatic number of a graph G. Under the proper coloring of a graph G with χ(G) colors, we define a signed graph from it. The obtained signed graph is defined as parity colored signed graph and denoted as Sc. The signs of edges of G are defined from the colors of the vertices as +( − ) if the colors on the adjacent vertices are of the same (opposite) parity. In this paper, we initiate a study on Sc. We further investigate the chromatic rna number of some classes of graphs concerning proper coloring.