journal-of-discrete-mathematical-sciences-and-cryptography

Journal of Discrete Mathematical Sciences and Cryptography

2169-0065 0972-0529

Taru Publications

10.47974/JDMSC-2345

On the b-chromatic number of 3-petal graph families

Rajaian

Winson

Department of Mathematics, University of Technology and Applied Sciences, Muscat, Sultanate of Oman Velayutham

Kolappan

Department of Mathematics, R M K Engineering College, Chennai, Tamil Nadu, 601206, India Moni

Santhosh

Department of Mathematics, University of Technology and Applied Sciences, Muscat, Sultanate of Oman Nazarudeen

Sulaiman

Department of Mathematics, University of Technology and Applied Sciences, Muscat, Sultanate of Oman

29 4 1609 1627

18 03 2026

The definition of b-coloring of a graph leads to the construction of what we call as Color Class Complete Graph (CCCG). We find the b-chromatic number of the p-petal graph, when p = 3, using the CCC Graph. We also find the b-chromatic number of the line graph, middle graph and the total graph of the p-petal graph.

b-coloring b-chromatic number p-petal graph Line graph Complement graph

access

open

retracted