Skip to content

Author

H. Bhapkar

We have 1 of 43 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

A novel approach for constructing a minimum spanning tree

It is proved that the classical cut property always produces a minimum spanning tree of a connected graph, and may be useful for large weighted networks such as communication networks, wiring connections, and transportation networks.

H. Bhapkar, Rezwan Ul Shaban, S. Mir et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.