J. Kok

most citedContemplating on Brush Numbers of Mycielski Jaco Graphs,

μ (J_{n} (1)), n \in N

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2025

Marcello's completion of graphs

Johan Kok

This paper initiates a study on a new optimization problem with regards to graph completion. The defined procedure is called, \emph{Marcello's completion} of a graph. For graph $G$ …

math.CO2015★ 1 cited

Contemplating on Brush Numbers of Mycielski Jaco Graphs, $μ (J_{n} (1)), n \in N$

Johan Kok, Susanth C., Sunny Joseph Kalayathankal

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

Marcello's completion of graphs

Contemplating on Brush Numbers of Mycielski Jaco Graphs, μ(Jn​(1)),n∈N

Contemplating on Brush Numbers of Mycielski Jaco Graphs, $μ (J_{n} (1)), n \in N$