5 citations · 19 across the 15 of their papers we have counts for
4 papers · 2 filters
Introduction to the McPherson number, of a simple connected graph
Johan Kok, Susanth C
The concept of the \emph{McPherson number} of a simple connected graph on vertices denoted by , is introduced. The recursive concept, called the \emph{McPherson recur…
Contemplating some invariants of the Jaco Graph,
Johan Kok, Susanth C
Kok et.al. [7] introduced Jaco Graphs (\emph{order 1}). In this essay we present a recursive formula to determine the \emph{independence number} with, $\Bbb…
The Sum and Product of Independence Numbers of Graphs and their Line Graphs
Susanth C, Sunny Joseph Kalayathankal
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the bounds on the sum and pr…
The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
Sunny Joseph Kalayathankal, Susanth C
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. Fi…