activity
20142018
most citedA Study on Set-Graphs

5 citations · 19 across the 15 of their papers we have counts for

collaborators
Showing 2015 · math.COShow all

6 papers · 2 filters

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,} and 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 be a simple connected directed graph on vertices and let be a non-empty subset of and denote the undirected subgraph induced…

math.CO2015

A Note on the Gutman Index of Jaco Graphs

Johan Kok, Susanth C, Sunny Joseph Kalayathankal

The concept of the \emph{Gutman index}, denoted was introduced for a connected undirected graph . In this note we apply the concept to the underlying graphs of the fami…

math.CO2015★ 1 cited

A note on the Brush Numbers of Mycielski Graphs,

Johan Kok, Susanth C, Sunny Joseph Kalayathankal

The concept of the brush number was introduced for a simple connected undirected graph . The concept will be applied to the Mycielskian graph of a simple connect…

math.CO2015★ 1 cited

Contemplating on Brush Numbers of Mycielski Jaco Graphs,

Johan Kok, Susanth C., Sunny Joseph Kalayathankal

The concept of the brush number was introduced for a simple connected undirected graph . The concept will be applied to the Mycielski Jaco graph $μ(J_n(1)), n \in \Bbb…