5 citations · 24 across the 13 of their papers we have counts for
8 papers · 1 filter
On Integer Additive Set-Filtered Graphs
N. K. Sudev, K. P. Chithra, K. A. Germina
Let denote the set of all non-negative integers and be its power set. An integer additive set-labeling (IASL) of a graph is an inject…
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…
On the Sparing Number of the Edge-Corona of Graphs
K. P. Chithra, K. A. Germina, N. K. Sudev
Let be the set of all non-negative integers and be its the power set. An integer additive set-indexer (IASI) of a graph is an injecti…
A Note on the Sparing Number of the Sieve Graphs of Certain Graphs
Naduvath Sudev, Augustine Germina
Let denote the set of all non-negative integers and be its power set. An integer additive set-indexer (IASI) of a given graph is an i…
Strong Integer Additive Set-valued Graphs: A Creative Review
N. K. Sudev, K. A. Germina, K. P. Chithra
For a non-empty ground set , finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph is an injective function , where $…
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 .…