On chromatic curling number of graphs

C Susanth, NK Sudev, SJ Kalayathankal - arXiv preprint arXiv:1804.01860, 2018 - arxiv.org
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 …

A STUDY ON EQUITABLE CHROMATIC CURLING NUMBER OF GRAPHS

S Naduvath, CV Rachana, C Susanth… - CONTEMPORARY …, 2017 - hal.science
The curling number of a graph G may be defined as the number of times an element in the
degree sequence of G appears the most. Graph colouring is an assignment of colours …

A study on the curling number of graph classes

SJ Kalayathankal, NK Sudev, KP Chithra… - arXiv preprint arXiv …, 2015 - arxiv.org
Given a finite nonempty sequence $ S $ of integers, write it as $ XY^ k $, consisting of a
prefix $ X $(which may possibly be empty), followed by $ k $ copies of a non-empty string …

[PDF][PDF] A study on the curling number of graph classes

C Susanth, SJ Kalayathankal, NK Sudev… - arXiv preprint arXiv …, 2015 - researchgate.net
Given a finite nonempty sequence S of integers, write it as XY k, consisting of a prefix X
(which may be empty), followed by k copies of a non-empty string Y. Then, the greatest such …

[PDF][PDF] A study on the curling number of certain graph classes

C Susanth, SJ Kalayathankal, N Sudev… - arXiv preprint arXiv …, 2015 - academia.edu
Given a finite nonempty sequence S of integers, write it as XY k, consisting of a prefix X
(which may possibly be empty), followed by k copies of a nonempty string Y. Then, the …