5 citations · 46 across the 55 of their papers we have counts for
57 papers
On Certain Topological Indices of Signed Graphs
Sudev Naduvath, Johan Kok
The first Zagreb index of a graph is the sum of squares of the vertex degrees in a graph and the second Zagreb index of is the sum of products of degrees of adjacent vertic…
On Derivative Euler Phi Function Set-Graphs
Johan Kok, Eunice Gogo Mphako-Banda, Sudev Naduvath
In this paper, we study some graph theoretical properties of two derivative Euler Phi function set-graphs. For the Euler Phi function , , the set $S_ϕ(n) =\{…
Stability in Respect of Chromatic Completion of Graphs
Eunice Mphako-Banda, Johan Kok
In an improper colouring an edge for which, is called a \emph{bad edge}. The notion of the \emph{chromatic completion number} of a graph denoted by is…
Chromatic Completion Number
E. G Mphako-Banda, J. Kok
We use a well known concept of proper vertex colouring of a graph to introduce the construction of a chromatic completion graph and its related parameter, the chromatic completion…
On -Colouring of Chithra Graphs
Johan Kok, Sudev Naduvath
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 enginee…
-Colouring of Cycle Related Graphs
Johan Kok, Sudev Naduvath
With respect to a proper colouring of a graph , we know that . If distinct colours represent distinct technology types to be located at vertices the…
A Note on -Colouring of Jahangir Graphs
Johan Kok, Sudev Naduvath
In this paper, we discuss -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 definiti…
Some New Results on Proper Colouring of Edge-set Graphs
Johan Kok, Sudev Naduvath
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding t…
On Chromatic Core Subgraph of Simple Graphs
Johan Kok, Sudev Naduvath, M. Jerlin Seles +1
If distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring, a disaster recovery strategy…
Some Properties of Fibonacci-Sum Set-Graphs
Eunice G Mphako-Banda, Johan Kok, Sudev Naduvath
In this paper we study some properties of Fibonacci-sum set-graphs. The aforesaid graphs are an extension of the notion of Fibonacci-sum graphs to the notion of set-graphs. The col…
On the Rainbow Neighbourhood Number of Set-Graphs
Johan Kok, Sudev Naduvath
In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respe…
On the Fading Number of a Graph
Johan Kok, Sudev Naduvath, Eunice Gogo Mphako-Banda
The closed neighbourhood of a vertex of a graph , consisting of at least one vertex from all colour classes with respect to a proper colouring of , is called a rai…
Reflection on rainbow neighbourhood numbers of graphs
Johan Kok, Sudev Naduvath, Orville Buelban
A rainbow neighbourhood of a graph with respect to a proper colouring $\C$ of is the closed neighbourhood of a vertex in such that consists of vertice…
Rainbow Neighbourhood Equate Number of Graphs
Johan Kok, Sudev Naduvath
In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number of a graph denoted by is introduced. It is defined to be the minimum number o…
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…
An Essay on Compônentă Analysis of Graphs
Johan Kok, Sudev Naduvath
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…
Johan Colouring of Graph Operations
Johan Kok, Sudev Naduvath
A vertex of a given graph is said to be in a rainbow neighbourhood of if every colour class of consists of at least one vertex from the closed neighbourhood . A m…
Rainbow Neighbourhoods of Graphs
Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil
In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph . We report on preliminary…
A note on chromatic blending of colour clusters
Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil
For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, is a colour class, and , we investigate…
On Certain -Colouring Parameters of Graphs
Sudev Naduvath
In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood…
Chromatic Zagreb indices for graphical embodiment of colour clusters
Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil
For a colour cluster , where is a colour class such that , a…
A Study on the Quadratic Jaco Graph
R. Jayasree, A. Kulandai Therese, U. Mary +1
In this paper we introduce the quadratic Jaco graph. The characteristics, properties and some graph invariants of quadratic Jaco graphs are discussed. The observation that quadrati…
A Study on Clique Invariants of Jaco-type Graphs
M. Jerlin Seles, U. Mary, Johan Kok
The first study related to this paper was on the notion of primitive holes. This paper reports on research in respect of clique parameters and related properties thereof within Jac…