1 citations · 1 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Constructing edge-disjoint spanning trees in augmented cubes
S. A. Mane
Let T1, T2,.... Tk be spanning trees in a graph G. If for any pair of vertices u and v of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges then T1…
math.CO2017★ 1 cited
Construction of Four Completely Independent Spanning Trees on Augmented Cubes
S. A. Mane, S. A. Kandekar, B. N. Waphare
Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and comm…