Show simple item record

Equitable chromatic number of weak modular product of Some graphs

dc.creatorKaliraj, K.
dc.creatorNarmadha Devi, R.
dc.creatorVernold Vivin, J.
dc.date2022-08-26
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5140
dc.identifier10.22199/issn.0717-6279-5140
dc.descriptionAn equitable coloring of a graph G is a proper coloring of the vertices of G such that the number of vertices in any two color clases differ by at most one. The equitable chromatic number χ=(G) of a graph G is the minimum number of colors needed for an equitable coloring of G. In this paper, we obtain the equitable chromatic number of weak modular product of two graphs G and H, denoted by G o H. First, we consider the graph G o H, where G is the path graph, and H be any simple graph like the path, the cycle graph, the complete graph. Secondly, we consider G and H as the complete graph and cycle graph respectively. Finally, we consider G as the star graph and H be the complete graph and star graph.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5140/4122
dc.rightsCopyright (c) 2022 K. Kaliraj, R. Narmadha Devi, J. Vernold Vivinen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 41 No. 5 (2022); 1051-1062en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 41 Núm. 5 (2022); 1051-1062es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2022-05
dc.subjectequitable coloringen-US
dc.subjectweak modular producten-US
dc.subjectpath graphen-US
dc.subjectcycle graphen-US
dc.titleEquitable chromatic number of weak modular product of Some graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record