Sudev Naduvath

most citedA Study on the Nourishing Number of Graphs and Graph Powers

7 citations · 7 across the 4 of their papers we have counts for

collaborators

4 papers

math.GM2016

Chromatic Zagreb indices for graphical embodiment of colour clusters

Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil

For a colour cluster $C = (C_{1}, C_{2}, C_{3}, \dots, C_{ℓ})$ , where $C_{i}$ is a colour class such that $∣ C_{i} ∣ = r_{i}$ , a…

math.CO2014

Arithmetic Intger Additive Set-Idexers of Graph Operations

N. K. Sudev, K. A. Germina

An integer additive set-indexer is an injective function $f : V (G) \to 2^{N_{0}}$ such that the induced function $g_{f} : E (G) \to 2^{N_{0}}$ defined by $g_f (uv) = f(u)+ f(…

math.CO2014

Certain Types of Total Irregularities of Graphs and Digraphs

Johan Kok, Sudev Naduvath

The total irregularity of a simple undirected graph $G$ is denoted by $i r r_{t} (G)$ and is defined as $i r r_{t} (G) = \frac{1}{2} u, v \in V (G) \sum ∣ d (u) - d (v) ∣$ . In this paper, t…

math.CO2014★ 7 cited

A Study on the Nourishing Number of Graphs and Graph Powers

N K Sudev, K A Germina

An integer additive set-indexer is defined as an injective function $f : V (G) \to 2^{N_{0}}$ such that the induced function $g_{f} : E (G) \to 2^{N_{0}}$ defi…