Abstract
An 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
