Loading [MathJax]/jax/output/CommonHTML/jax.js
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.

Certain chromatic sums of some cycle-related graph classes

    https://doi.org/10.1142/S1793830916500506Cited by:10 (Source: Crossref)

    Let 𝒞={c1,c2,c3,,ck} be a certain type of proper k-coloring of a given graph G and θ(ci) denote the number of times a particular color ci is assigned to the vertices of G. Then, the coloring sum of a given graph G with respect to the coloring 𝒞, denoted by ω𝒞(G), is defined to be ω(𝒞)=ki=1iθ(ci). The coloring sums such as χ-chromatic sum, χ+-chromatic sum, b-chromatic sum, b+-chromatic sum, etc. are some of these types of coloring sums that have been studied recently. Motivated by these studies on certain chromatic sums of graphs, in this paper, we study certain chromatic sums for some standard cycle-related graphs.

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

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