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 chromatic Zagreb indices of certain graphs

    https://doi.org/10.1142/S1793830917500148Cited by:7 (Source: Crossref)

    Let G be a finite and simple undirected connected graph of order n1 and let φ be a proper vertex coloring of G. Denote φ:vicj simply, c(vi)=cj. In this paper, we introduce a variation of the well-known Zagreb indices by utilizing the parameter c(v) instead of the invariant d(v) for all vertices of G. The new indices are called chromatic Zagreb indices. We study these new indices for certain classes of graphs and introduce the notion of chromatically stable graphs.

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

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