Let G be a finite and simple undirected connected graph of order n≥ 1 and let φ be a proper
vertex coloring of G. Denote φ: vi↦ cj simply, c (vi)= cj. In this paper, we introduce a variation …

In this paper, we introduce the notion of the rainbow neighbourhood and a related graph
parameter namely the rainbow neighbourhood number and report on preliminary results …

Let 𝒞={c 1, c 2, c 3,…, ck} be a certain type of proper k-coloring of a given graph G and θ (ci)
denote the number of times a particular color ci is assigned to the vertices of G. Then, the …

Coloring the vertices of a graph G according to certain conditions is a random experiment
and a discrete random variable X is defined as the number of vertices having a particular …

Colouring the vertices of a graph $ G $ according to certain conditions can be considered as
a random experiment and a discrete random variable $ X $ can be defined as the number of …

Coloring the vertices of a graph G subject to given conditions can be considered as a
random experiment and corresponding to this experiment, a discrete random variable X can …

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 …

In this paper, we study skew constacyclic codes over the ring $\mathbb {Z} _ {q} R $ where $
R=\mathbb {Z} _ {q}+ u\mathbb {Z} _ {q} $, $ q= p^{s} $ for a prime $ p $ and $ u^{2}= 0. $ We …

A vertex colouring of a given graph $ G $ can be considered as a random experiment. A
discrete random variable $ X $, corresponding to this random experiment, can be defined as …

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