1 paper · 1 filter
Sanchita Paul, Bapan Das, Avishek Adhikari +1
Let G=(V,E) be a connected graph and dG(u,v) be the shortest distance between the vertices u and v in G. A set S={s1,s2,⋯,sn}⊂V(G) is said to…