On chromatic Zagreb indices of certain graphs
Abstract
Let G be a finite and simple undirected connected graph of order n≥1 and let φ be a proper vertex coloring of G. Denote φ:vi↦cj 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.
Remember to check out the Most Cited Articles! |
---|
Be inspired by these NEW Mathematics books for inspirations & latest information in your research area! |