1 citations · 1 across the 4 of their papers we have counts for
4 papers
The 3-path-connectivity of the augmented cubes
S. A. Kandekar, R. Barabde, S. A. Mane
Connectivity is a cornerstone concept in graph theory, essential for evaluating the robustness of networks against failures. To better capture fault tolerance in complex systems, r…
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…
Decomposition of Augmented Cubes into Regular Connected Pancyclic Subgraphs
S. A. Kandekar, Y. M. Borse, B. N. Waphare
In this paper, we consider the problem of decomposing the augmented cube into two spanning, regular, connected and pancyclic subgraphs. We prove that for and $ 2…
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…