4 citations · 14 across the 12 of their papers we have counts for
9 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…
Competition Graphs of Jaco Graphs and the Introduction of the Grog Number of a Simple Connected Graph
Johan Kok, Susanth C, Sunny Joseph Kalayathankal
Let be a simple connected directed graph on vertices and let be a non-empty subset of and denote the undirected subgraph induced…
A Note on the Gutman Index of Jaco Graphs
Johan Kok, Susanth C, Sunny Joseph Kalayathankal
The concept of the \emph{Gutman index}, denoted was introduced for a connected undirected graph . In this note we apply the concept to the underlying graphs of the fami…
A note on the Brush Numbers of Mycielski Graphs,
Johan Kok, Susanth C, Sunny Joseph Kalayathankal
The concept of the brush number was introduced for a simple connected undirected graph . The concept will be applied to the Mycielskian graph of a simple connect…
Contemplating on Brush Numbers of Mycielski Jaco Graphs,
Johan Kok, Susanth C., Sunny Joseph Kalayathankal
The concept of the brush number was introduced for a simple connected undirected graph . The concept will be applied to the Mycielski Jaco graph $μ(J_n(1)), n \in \Bbb…