Independent spanning trees of chordal rings

DOI10.1016/S0020-0190(98)00205-1zbMath1338.68220OpenAlexW2054018737WikidataQ127088251 ScholiaQ127088251MaRDI QIDQ294645

Koji Obokata, Yukihiro Iwasaki, Yoshihide Igarashi, Yuka Kajiwara

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098002051?np=y

zbMATH Keywords

fault toleranceindependent spanning treeschordal ringsbroadcastschannel graphs

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 (20)

Construction independent spanning trees on locally twisted cubes in parallel ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ 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 ⋮ Completely independent spanning trees in torus networks ⋮ Completely independent spanning trees in some regular graphs ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Independent spanning trees on even networks ⋮ Structural properties of subdivided-line graphs ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ 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 ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent spanning trees in crossed cubes

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• On independent spanning trees
• Output-sensitive reporting of disjoint paths
• Independent trees in graphs
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

This page was built for publication: Independent spanning trees of chordal rings