5 citations · 46 across the 55 of their papers we have counts for
13 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…
The -Chromatic Number of Certain Graphs and Digraphs
Johan Kok, Naduvath Sudev
The studies on -chromatic number attracted much interest since its introduction. In this paper, we discuss the -chromatic number of certain classes of graphs and digraphs. 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 Edge-Set Graphs of Certain Graphs
Johan Kok, N. K. Sudev, K. P. Chithra
Let be a simple connected graph, with In this paper, we define an edge-set graph constructed from the graph such that any vertex o…
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…
On the Curling Number of Certain Graphs
Johan Kok, Naduvath Sudev, Chithra Sudev
In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence of the degree sequence of…
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 .…
On the Pythagorean Holes of Certain Graphs
Johan Kok, N. K. Sudev, K. P. Chithra
A \emph{primitive hole} of a graph is a cycle of length 3 in . The number of primitive holes in a given graph is called the primitive hole number of the graph . The p…
The Primitive Hole Number of Certain Graphs
Johan Kok, N. K. Sudev
A hole of a simple connected graph is a chordless cycle where in the graph . The girth of a simple connected graph is the smallest cycle…
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…