Edge-disjoint spanning trees on the star network with applications to fault tolerance

DOI10.1109/12.485370zbMath1068.68591OpenAlexW2169103383MaRDI QIDQ4420893

Selim G. Akl, Paraskevi Fragopoulou

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0bbf792cae57693188b085ba5cc7f0577292e75f

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (21)

Constructing edge-disjoint spanning trees in twisted cubes ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks ⋮ Minimum time broadcast in faulty star networks ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ Independent spanning trees on twisted cubes ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ The generalized 4-connectivity of hypercubes ⋮ Completely independent spanning trees in torus networks ⋮ Edge-independent spanning trees in augmented cubes ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Deterministic Models of Communication Faults ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Independent spanning trees on folded hyper-stars ⋮ On randomized broadcasting in star graphs ⋮ Path-connectivity of lexicographic product graphs ⋮ Constructing edge-disjoint spanning trees in locally twisted cubes ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs ⋮ Broadcasting in hypercubes and star graphs with dynamic faults.

This page was built for publication: Edge-disjoint spanning trees on the star network with applications to fault tolerance