5 citations · 19 across the 15 of their papers we have counts for
10 papers · 1 filter
A study on the curling number of graph classes
Susanth C, Sunny Joseph Kalayathankal, N. K. Sudev +2
Given a finite nonempty sequence of integers, write it as , consisting of a prefix (which may possibly be empty), followed by copies of a non-empty string . Th…
Some New Results on the Curling Number of Graphs
N. K. Sudev, C. Susanth, K. P. Chithra +2
Let be a finite string. Write in the form , consisting of a prefix (which may be empty), followed by copies of a non-empty str…
Curling Numbers of Certain Graph Powers
Susanth C., Sunny Joseph Kalayathankal, N. K. Sudev +2
Given a finite nonempty sequence of integers, write it as , where is a power of greatest exponent that is a suffix of : this is the curling number of . Th…
A Study on Linear Jaco Graphs
Johan Kok, Susanth C., Sunny Joseph Kalayathankal
We introduce the concept of a family of finite directed graphs (\emph{positive integer order,} and which are directed graphs deriv…
Operations on Covering Numbers of Certain Graph Classes
Susanth C, Sunny Joseph Kalayathankal
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the operations on the Indepe…
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 .…