Prashant Pralhad Malavadkar

According to our database, Prashant Pralhad Malavadkar authored at least 8 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2026

On the Genus of Cartesian products of complete graph K_12t+7 with cycles and paths.

Jyoti Anant Pulgam, Prashant Pralhad Malavadkar

J. Comb. Optim., April, 2026

An Efficient Algorithm for Path Matrix Computation and Improved Path Energy Bounds.

Amol P. Narke, Prashant Pralhad Malavadkar

Proceedings of the Applied Algorithms - Third International Conference, 2026

2025

Spanning edge-cyclability of augmented cubes.

Uday Jagadale, Amruta Shinde, Prashant Pralhad Malavadkar

Int. J. Parallel Emergent Distributed Syst., November, 2025

On the circuits of splitting matroids representable over GF(p).

Prashant Pralhad Malavadkar, Uday Jagadale, Sachin Gunjal

Ars Comb., June, 2025

h-Extra r-Component Connectivity of 3-Ary n-Cubes.

Uday Jagadale, Amruta Shinde, Prashant Pralhad Malavadkar

J. Interconnect. Networks, 2025

On the Characterization of Eulerian es-Splitting p-Matroids.

Uday Jagadale, Sachin Gunjal, Prashant Pralhad Malavadkar, M. M. Shikare, B. N. Waphare

Proceedings of the Applied Algorithms - Second International Conference, 2025

2022

On equipathenergetic graphs and new bounds on path energy.

Amol P. Narke, Prashant Pralhad Malavadkar

CoRR, 2022

2021

On n-connected minors of the es-splitting binary matroids.

Prashant Pralhad Malavadkar, Santosh Baburao Dhotre, Maruti Shikare

Electron. J. Graph Theory Appl., 2021