Advances and Applications in Discrete Mathematics
Volume 31, , Pages 1 - 12
(May 2022) http://dx.doi.org/10.17654/0974165822022 |
|
SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
Rubul Moran, Niranjan Bora, Aditya Pegu and Monjit Chamua
|
Abstract: Consider a finite set T of positive integers including zero. Then the graph G yields a T-coloring if there exists a function defined on the set of vertices such that for any edge of G and A graph G admits a particular type of T-coloring, namely, strong T-coloring which is defined as the map on the set of vertices so that if then does not lie in the set T and the values and are distinct for any two distinct edges and of G. ST-chromatic number of the graph G, denoted by is the least number of colors required for an ST-coloring of G. Again, is the considering each vertex, whereas is the considering each edge in G. In this paper, some results related to chromatic number, span and edge span associated with T- and ST-coloring of generalized butterfly graphs are presented.
|
Keywords and phrases: chromatic number, edge span, generalized butterfly graphs, graph coloring, span.
|
|
Number of Downloads: 53 | Number of Views: 103 |
|