Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
From MaRDI portal
Publication:1426221
DOI10.1016/S0743-7315(03)00107-2zbMath1059.68081MaRDI QIDQ1426221
Publication date: 14 March 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00107-2
Fault tolerance; Alternating group graphs; Arrangement graphs; Edge-disjoint spanning trees; Node-disjoint paths
68R10: Graph theory (including graph drawing) in computer science
Related Items
Construction of optimal independent spanning trees on folded hypercubes, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Constructing edge-disjoint spanning trees in locally twisted cubes, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Constructing edge-disjoint spanning trees in twisted cubes, Independent spanning trees on folded hyper-stars