J. Kok

activity

20152020

most citedA Study on Set-Graphs

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

collaborators

Showing math.COShow all

4 papers · 1 filter

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★ 3 cited

On the Curling Number of Certain Graphs

Johan Kok, Naduvath Sudev, Chithra Sudev

In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of…

math.CO2015

The Primitive Hole Number of Certain Graphs

Johan Kok, N. K. Sudev

A hole of a simple connected graph $G$ is a chordless cycle $C_{n},$ where $n \in N, n \geq 4,$ in the graph $G$ . The girth of a simple connected graph $G$ is the smallest cycle…

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…