5 citations · 16 across the 7 of their papers we have counts for
8 papers · 1 filter
On Certain Colouring Parameters of Mycielski Graphs of Some Graphs
K. P. Chithra, N. K. Sudev, S. Satheesh +2
Colouring the vertices of a graph according to certain conditions can be considered as a random experiment and a discrete random variable can be defined as the number of ve…
Some Results on the -Colouring Parameters of Graphs
N. K. Sudev, K. P. Chithra, Johan Kok
A vertex colouring of a given graph can be considered as a random experiment. A discrete random variable , corresponding to this random experiment, can be defined as the col…
Certain Chromatic Sums of Some Cycle Related Graph Classes
N. K. Sudev, K. P. Chithra, Johan Kok
Let be a certain type of proper -colouring of a given graph and denote the number of times a particular colour is…
On Integer Additive Set-Filtered Graphs
N. K. Sudev, K. P. Chithra, K. A. Germina
Let denote the set of all non-negative integers and be its power set. An integer additive set-labeling (IASL) of a graph is an inject…
On the Sparing Number of the Edge-Corona of Graphs
K. P. Chithra, K. A. Germina, N. K. Sudev
Let be the set of all non-negative integers and be its the power set. An integer additive set-indexer (IASI) of a graph is an injecti…
Strong Integer Additive Set-valued Graphs: A Creative Review
N. K. Sudev, K. A. Germina, K. P. Chithra
For a non-empty ground set , finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph is an injective function , where $…