Some results on b-chromatic topological indices of some graphs

Graph coloring is assigning weights, integers, or colors to edges, vertices, or both in a graph subject to certain conditions. Proper coloring C of graph G refers to assigning weights, integers, or colors to the vertices, edges, or both so that adjacent vertices or adjacent edges get a different col...

Full description

Saved in:
Bibliographic Details
Main Authors: Glory, C., Manjunath, N.
Format: Conference Proceeding
Language:English
Subjects:
Apexes
Graph coloring
Graph theory
Graphs
Integers
Irregularities
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph coloring is assigning weights, integers, or colors to edges, vertices, or both in a graph subject to certain conditions. Proper coloring C of graph G refers to assigning weights, integers, or colors to the vertices, edges, or both so that adjacent vertices or adjacent edges get a different color. A b-coloring follows proper vertex coloring with subject to an additional property that each color class should have at least one vertex with a neighbor in all the other color classes. The notion of Chromatic Zagreb index and irregularity index was introduced recently. This paper introduces the concept of b-Chromatic Zagreb indices and b-Chromatic irregularity indices. Also, we compute these indices for certain standard classes of graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0164631