1 citations · 1 across the 1 of their papers we have counts for
1 paper
Sambhu Charan Barman, Sukumar Mondal, Madhumangal Pal
In a graph, a spanning tree is said to be a tree t-spanner of the graph if the distance between any two vertices in is at most times their distance in . The tree t-spanner has many…