Coloring the vertices of a graph G according to certain conditions can be considered as a
random experiment and a discrete random variable (rv) X can be defined as the number of …

A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class
of G consists of at least one vertex from the closed neighbourhood N [v]. A maximal proper …

An equitable colouring of a graph $ G $ is a proper vertex coloring $\C $ of $ G $ such that
the cardinalities of any two color classes in $ G $ with respect to $\C $ differ by at most one …

In this paper, we discuss J-colouring of the family of Jahangir graphs. Note that the family of
Jahangir graphs is a wide ranging family of graphs which by a generalised definition …

In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number
of a graph $ G $ denoted by $ ren (G) $ is introduced. It is defined to be the minimum …

The family of Chithra graphs is a wide ranging family of graphs which includes any graph of
size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering …

A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a
proper coloring C of G, if the closed neighbourhood N [v] of the vertex v consists of at least …

In this paper, a new type of colouring called J-colouring is introduced. This colouring
concept is motivated by the newly introduced invariant called the rainbow neighbourhood …

ON EQUITABLE COLORING OF EXTENTED CORONA OF SOME GRAPHS Page 1 Palestine
Journal of Mathematics Vol. 10 (Special Issue II, 2021), 131–142 © Palestine Polytechnic …

This paper initiates a study on a new coloring regime which sets conditions in respect of the
degrees deg (v) and deg (u) where, v, u∈ V (G) and vu∈ E (G). This new coloring regime is …