Independent spanning trees of chordal rings

DOI10.1016/S0020-0190(98)00205-1zbMath1338.68220WikidataQ127088251 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 tolerance; independent spanning trees; chordal rings; broadcasts; channel graphs

Mathematics Subject Classification ID

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

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Completely independent spanning trees in torus networks, Constructing Node-Independent Spanning Trees in Augmented Cubes, CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2), Independent spanning trees in crossed cubes, Construction of optimal independent spanning trees on folded hypercubes, Completely independent spanning trees in some regular graphs, Constructing independent spanning trees for locally twisted cubes, Independent spanning trees on even networks, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, 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\), 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, Structural properties of subdivided-line graphs, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, An improved algorithm to construct edge-independent spanning trees in augmented cubes, Construction independent spanning trees on locally twisted cubes in parallel, Constructing edge-disjoint spanning trees in twisted cubes, Independent spanning trees on folded hyper-stars, Finding Totally Independent Spanning Trees with Linear Integer Programming

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