activity
20142025
most citedOn Certain Colouring Parameters of Graphs

8 citations · 12 across the 18 of their papers we have counts for

collaborators
Showing 2014Show all

9 papers · 1 filter

math.CO2014

A note on the Brush Number of Jaco Graphs, $J_n(1), n \in \Bbb N

Johan Kok

The concept of the brush number was introduced for a simple connected undirected graph . This note extends the concept to a special family of directed graphs and declar…

math.CO2014

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…

math.CO2014

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…

math.CO2014

The Derivative Degree Sequences of Finite Simple Connected Graphs are Parking Functions

Johan Kok

Parking functions are well researched and interesting results are found in the listed references and more. Some introductory results stemming from application to degree sequences o…

math.CO2014

A note on the number of edges of the Jaco Graph, $J_n(1), n \in \Bbb N

Johan Kok, Vivian Mukungunugwa

Kok et.al. [3] introduced Jaco Graphs \emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph . H…

math.CO2014

A note on -Zagreb indices in respect of Jaco Graphs, and the introduction of Khazamula irregularity

Johan Kok, Vivian Mukungunugwa

The topological indices related to the \emph{first Zagreb index,} and the \emph{second Zagreb index,} are the oldest irregularity measures researched. Al…