S. Kalayathankal

activity

20142018

most citedA Study on Linear Jaco Graphs

4 citations · 14 across the 12 of their papers we have counts for

collaborators

Showing math.GMShow all

4 papers · 1 filter

math.GM2018★ 1 cited

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

A study on the curling number of graph classes

Susanth C, Sunny Joseph Kalayathankal, N. K. Sudev +2

Given a finite nonempty sequence $S$ of integers, write it as $X Y^{k}$ , consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$ . Th…

math.GM2015★ 2 cited

Some New Results on the Curling Number of Graphs

N. K. Sudev, C. Susanth, K. P. Chithra +2

Let $S = S_{1} S_{2} S_{3} \dots S_{n}$ be a finite string. Write $S$ in the form $X Y Y \dots Y = X Y^{k}$ , consisting of a prefix $X$ (which may be empty), followed by $k$ copies of a non-empty str…

math.GM2015★ 3 cited

Curling Numbers of Certain Graph Powers

Susanth C., Sunny Joseph Kalayathankal, N. K. Sudev +2

Given a finite nonempty sequence $S$ of integers, write it as $X Y^{k}$ , where $Y^{k}$ is a power of greatest exponent that is a suffix of $S$ : this $k$ is the curling number of $S$ . Th…