269 citations
- Acharya Nagarjuna UniversityIN5 papers
- Homi Bhabha National InstituteIN4 papers
- Saha Institute of Nuclear PhysicsIN4 papers
- Variable Energy Cyclotron CentreIN4 papers
- Raman Research InstituteIN3 papers
- Swami Ramanand Teerth Marathwada UniversityIN3 papers
- Tata Institute of Fundamental ResearchIN3 papers
- Banaras Hindu UniversityIN2 papers
- California Institute of TechnologyUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Government College of SciencePK2 papers
- Indian Institute of Technology BombayIN2 papers
4 papers · 1 filter
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…
Audio Steganography: LSB Technique Using a Pyramid Structure and Range of Bytes
Satish Bhalshankar, Avinash K. Gulve
The demand for keeping the information secure and confidential simultaneously has been progressively increasing. Among various techniques- Audio Steganography, a technique of embed…
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 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 .…