Processing math: 100%
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 coloring parameters of Mycielski graphs of some graphs

    https://doi.org/10.1142/S1793830918500301Cited by:1 (Source: Crossref)

    Coloring the vertices of a graph G according to certain conditions can be considered as a random experiment and a discrete random variable X can be defined as the number of vertices having a particular color in the proper coloring of G. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph coloring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the coloring parameters of the Mycielskian of certain standard graphs.

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

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