5 papers · 1 filter
Pendant 3-tree Connectivity of Augmented Cubes
S. A. Mane, S. A. Kandekar
The Steiner tree problem in graphs has applications in network design or circuit layout. Given a set of vertices, a tree connecting all vertices of is called…
on removal of perfect matching from folded hypercubes
S. A. Mane
The hypercube Qn of dimension n is one of the most versatile and powerful interconnection networks. The n-dimensional folded cube denoted as FQn, a variation of the hypercube posse…
Connectivity and edge-bipancyclicity of hamming shell
S. A. Mane, B. N. Waphare
An Any graph obtained by deleting a Hamming code of length n from a n-cube Qn is called as a Hamming shell. It is well known that a Hamming shell is vertex-transitive, edge-transit…
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…
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…