5 citations · 24 across the 13 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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 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 is a chordless cycle where in the graph . The girth of a simple connected graph is the smallest cycle…