5 citations · 46 across the 55 of their papers we have counts for
12 papers · 1 filter
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…
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 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…
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…
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…
Certain Types of Total Irregularities of Graphs and Digraphs
Johan Kok, Sudev Naduvath
The total irregularity of a simple undirected graph is denoted by and is defined as . In this paper, t…
Total Irregularity and -Irregularity of Linear Jaco Graphs$
Johan Kok
Total irregularity of a simple undirected graph is defined to be . See Abdo and Dimitrov [2]. We allocate the \e…
Characteristics of Jaco Graphs,
Johan Kok, Paul Fisher, Bettina Wilkens +2
We introduce the concept of a family of finite directed graphs (order a) which are directed graphs derived from an infinite directed graph (order a), called the a-root digraph. The…
Characteristics of Finite Jaco Graphs,
Johan Kok, Paul Fisher, Bettina Wilkens +2
We introduce the concept of a family of finite directed graphs (order 1) which are directed graphs derived from an infinite directed graph (order 1), called the 1-root digraph. The…
A Study on Sprout Graphs
Johan Kok, Naduvath Sudev
Sprout graphs are finite directed graphs matured over a finite subset of the non-negative time line. A simple undirected connected graph on at least two vertices is required to con…
A Study on Ornated Graphs
Johan Kok, Sudev Naduvath, Vivian Mukungunugwa
In this paper, we introduce the notion of a finite non-simple directed graph, called an ornated graph and initiate a study on ornated graphs. An ornated graph is a directed graph o…