S. Kalayathankal

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

collaborators

4 papers

math.GM2018

On Chromatic Curling Number of Graphs

C. Susanth, N. K. Sudev, S. J. Kalayathankal

The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or…

math.CO2015★ 4 cited

A Study on Linear Jaco Graphs

Johan Kok, Susanth C., Sunny Joseph Kalayathankal

We introduce the concept of a family of finite directed graphs (\emph{positive integer order,} $f (x) = m x + c; x, m \in N$ and $c \in N_{0})$ which are directed graphs deriv…

math.CO2015

Operations on Covering Numbers of Certain Graph Classes

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 operations on the Indepe…

math.CO2015

Competition Graphs of Jaco Graphs and the Introduction of the Grog Number of a Simple Connected Graph

Johan Kok, Susanth C, Sunny Joseph Kalayathankal

Let $G^{\to}$ be a simple connected directed graph on $n \geq 2$ vertices and let $V^{*}$ be a non-empty subset of $V (G^{\to})$ and denote the undirected subgraph induced…