5 citations · 9 across the 4 of their papers we have counts for
Showing math.GMShow all
2 papers · 1 filter
math.GM2018
On Chromatic Curling Number of Graphs
C. Susanth, N. K. Sudev, S. J. Kalayathankal
The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or…
math.GM2015★ 5 cited
A Study on Set-Graphs
Johan Kok, K. P. Chithra, N. K. Sudev +1
A \textit{primitive hole} of a graph is a cycle of length in . The number of primitive holes in a given graph is called the primitive hole number of that graph .…