# A Note on St-Coloring of Some Non Perfect Graphs

ST-coloring of a graph G = (V,E) and a finite set T of positive integers containing zero is a coloring of the vertices with non negative integers such that for any two vertices of an edge, the absolute differences between the colors of the vertices do not belong to a fixed set T of non negative integers containing zero and for any two distinct edges their absolute differences are distinguishable The STChromatic number is the smallest number of colors required for an efficient Strong T coloring of a graph. This communication is about the ST-coloring of some non-perfect graphs, namely the Petersen graph, the Double Wheel graph, the Helm graph, the Flower graph, and the Sun Flower graph. The ST-chromatic number of these non-perfect graphs is computed.

**Author (s) Details**

**Rubul Moran
**Department of Mathematics Dibrugarh University, Assam-786004, India.

**Aditya Pegu
**Department of Mathematics Dibrugarh University, Assam-786004, India.

**I. J. Gogoi
**Department of Mathematics Dibrugarh University, Assam-786004, India.

**A. Bharali**

Department of Mathematics Dibrugarh University, Assam-786004, India..

**
**View Book : https://stm.bookpi.org/TPMCS-V11/article/view/1315