St-Coloring of Join and Disjoint Union of Graphs

Moran, Rubul; Bora, Niranjan; Baruah, Arun Kumar; Bharali, A.

doi:10.37418/amsj.9.11.44

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They discussed the parameters namely, ST −chromatic number and ST −span of these graphs. Moran et al, [10,11] have studied ST −colorings of various graph operations. Based on these works they also computed ST −chromatic numbers of some non perfect graphs viz., Petersen graph, Wheel graph, Helm graph, closed Helm Flower graph and Sun Flower graph [12].…”

Section: Introductionmentioning

confidence: 99%

On <img src=image/13430241_01.gif>-coloring and <img src=image/13430241_02.gif>-coloring ofWindmill Graph

Moran¹,

Bora²,

Bhattacharyya³

2023

View full text Add to dashboard Cite

The windmill graph W (r, m); m ≥ 3, r ≥ 2 is the graph formed by joining a common vertex to every vertex of m copies of the complete graph K r . T -coloring of a graph is a map h defined on the set of vertices in such a way that for any edge (w 1 , w 2 ), | h(w 1 ) − h(w 2 ) | does not belong to a finite set T of non-negative integers. Strong T-Coloring (ST -coloring) is a particular case of T -coloring and is defined as the map:for any two distinct edges (w 1 , w 2 ), (w 3 , w 4 ) ∈ E(G). Application of T and ST -coloring of graph naturally arises in the modeling of different scientific problems. Frequency assignment problem (FAP) is one of the well known problems in the field of telecommunication, which can be modeled using the concept of T and ST -coloring of graphs. In this paper, we will consider two special types of T -sets. The first one is λ-initial set, introduced by Cozzens and Roberts, which is of the form {0, 1, 2, . . . , λ} ∪ S where S is any arbitrary set that doesn't contain any multiple of (λ + 1). The second one is λ-multiple of q set, introduced by Raychaudhuri, which is of the form {0, q, 2q, . . . , λq} ∪ S, where S is a subset of the set {q + 1, q + 2, q + 3, . . . , λq}. We will discuss some parameters related to these two types of colorings viz. T -chromatic number, T -span, T -edge span on the basis of the two T -sets. We will also deduce some generalized results of ST -coloring of any graph based on any T -set, and with the help of these results we will obtain ST -chromatic number and bounds for the ST -span and ST -edge span of windmill graphs.

show abstract

Section: Introductionmentioning

confidence: 99%

On <img src=image/13430241_01.gif>-coloring and <img src=image/13430241_02.gif>-coloring ofWindmill Graph

Moran¹,

Bora²,

Bhattacharyya³

2023

View full text Add to dashboard Cite

show abstract

“…T-coloring on a number of graph operations, including Union, Join, Cartesian product, and Tensor product, was studied by Roselin et al [14] in 2022. The ST -coloring of numerous graph operations, including Union, Join, Cartesian product, Tensor product, and Corona product of graphs, was studied by Moran et al [12,13].…”

Section: Introductionmentioning

confidence: 99%

$T$ and $St$-Coloring of Corona Product and Edge Corona Product of Graphs

Moran,

Bora,

Begum

et al. 2023

Int. J. of Appl. Math.

View full text Add to dashboard Cite

When coloring a graph's vertices, a particular technique known as T -coloring is used to ensure that the absolute difference between the colors allocated to the end vertices of any edge will not be an element of a predetermined set T of non-negative integers that includes zero. A type of T -coloring of a graph known as ST -coloring is one in which there is a noticeable absolute difference between the assigned colors of each edge's end vertices. Here, we discuss these colorings on the Corona product and the edge corona network of graphs. We obtain a few findings on the chromatic numbers associated with the T and ST -colorings, as well as the span and edge span of these graph products.

show abstract