World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On certain parameters of equitable coloring of graphs

    https://doi.org/10.1142/S1793830917500549Cited by:6 (Source: Crossref)

    Coloring the vertices of a graph GG according to certain conditions is a random experiment and a discrete random variable XX is defined as the number of vertices having a particular color in the given type of coloring of GG and a probability mass function for this random variable can be defined accordingly. An equitable coloring of a graph GG is a proper coloring 𝒞 of G which an assignment of colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one. In this paper, we extend the concepts of arithmetic mean and variance, the two major statistical parameters, to the theory of equitable graph coloring and hence determine the values of these parameters for a number of standard graphs.

    AMSC: 05C15, 62A01
    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!