TARU PUBLICATIONS
Author

K. Nagendra Prasad

Department of Computer Science and Engineering - Artificial Intelligence  KKR and KSR Institute of Technology and Sciences, Guntur, Andhra Pradesh, 522017, India

Published papers
3
Citations
0
Views
242
Downloads
23

Publications

3 papers
Open Access Research Article·pp. 253–260·Vol. 29, Issue 1Jan 2026

Km, n biclique coverings : A novel combinatorial approach to discrete structures in network analysis

Honganur Raju Manjunath, Syed Rashid Anwar, Kumari Shipra, Sumeet Kaur, P. Appireddy, K. Nagendra Prasad

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2481

In this paper: Bipartite covers simplify complicated network viewing by breaking the graph into two full subgraphs. Network analysis determines network structure using combinatorial methods. The concept of Km,n bicl...

AbstractReferencesFull Text PDF (420 KB)Views: 48Downloads: 8Citations: 0
Open Access Research Article·pp. 271–279·Vol. 29, Issue 1Jan 2026

Employing the Erdős–Ko–Rado theorem to develop new techniques in combinatorial intersection theory

Sheela Hundekari, Sagarkumar S. Badhiye, Pallavi R. Rege, Budigi Prabhakar, K. Nagendra Prasad, S. Udaya Lakshmi

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2482

In this paper: The Erdūs–Ko–Rado (EKR) theorem is a renowned result in combinatorial mathematics. It tells a lot about cross-set groups. This study examines how the EKR theorem might inspire combinatorial intersecti...

AbstractReferencesFull Text PDF (496 KB)Views: 106Downloads: 7Citations: 0
Open Access Research Article·pp. 2207–2215·Vol. 28, Issue 6Sep 2025

Iterative Krylov subspace methods for large sparse linear systems

Saurabh Saoji, Budigi Prabhakar, Mikhal John, Kiran Ingle, Vrushali G. Raut, K. Nagendra Prasad

Published Online: 30 Sep 2025DOI: 10.47974/JIM-2362

In this paper: Large sparse linear systems, like those found in scientific computing, engineering models, and optimization problems, can be solved very efficiently using iterative Krylov subspace methods. The Genera...

AbstractReferencesFull Text PDF (489 KB)Views: 88Downloads: 8Citations: 0