The non-zero component graph of a finite dimensional vector space V over a finite field F is
the graph G (Va)=(V, E), where vertices of G (Va) are the non-zero vectors in V, two of which …

A rainbow neighbourhood of a graph G is the closed neighbourhood N v of a vertex v ∈ V
(G) v∈ V (G) which contains at least one colored vertex of each color in the chromatic …

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 …

A rainbow neighbourhood of a graph G with respect to a proper colouring C of G is the
closed neighbourhood N [v] of a vertex v in G such that N [v] consists of vertices from all …

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 most studies related to colouring of graphs and perhaps in the study of other invariants
and variants of graphs, the restrictions of non-triviality and connectedness are placed upon …

In an improper coloring, an edge $ uv $ for which, c (u)= c (v) is called a bad edge. The
notion of the chromatic completion number of a graph G denoted by ζ (G), is the maximum …

Let T n be a twist knot with n half‐twists and G n be the graph of T n. The closed
neighborhood N [v] of a vertex v in G n, which included at least one colored vertex for each …