2 papers
math.CO2025
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…
math.CO2025
Construction and Conditions for Completely Independent Spanning Trees in Hypercubes and Regular Bipartite Graphs
R. Barabde, S. A. Mane, S. A. Kandekar
A set of \( k \) spanning trees in a graph \( G \) is called a set of \textit{completely independent spanning trees (CISTs)} if, for every pair of vertices \( x \) and \( y \), the…