Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.

DOI10.1016/S0743-7315(03)00107-2zbMath1059.68081OpenAlexW1973587859MaRDI QIDQ1426221

Chin-Tsai Lin

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

zbMATH Keywords

Fault toleranceAlternating group graphsArrangement graphsEdge-disjoint spanning treesNode-disjoint paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Constructing edge-disjoint spanning trees in twisted cubes ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Independent spanning trees on folded hyper-stars ⋮ Constructing edge-disjoint spanning trees in locally twisted cubes

This page was built for publication: Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.