Independent spanning trees of chordal rings

DOI10.1016/S0020-0190(98)00205-1zbMATH Open1338.68220OpenAlexW2054018737WikidataQ127088251 ScholiaQ127088251MaRDI QIDQ294645FDOQ294645

Authors: Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi 

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

Recommendations

• A note on isomorphic chordal rings
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Reliabilities of chordal rings
• Completely independent spanning trees in some regular graphs
• Independent trees in graphs

zbMATH Keywords

fault tolerancebroadcastschannel graphschordal ringsindependent spanning trees

Mathematics Subject Classification ID

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

Cites Work

• Output-sensitive reporting of disjoint paths
• The multi-tree approach to reliability in distributed networks
• On independent spanning trees
• Independent trees in graphs
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Title not available (Why is that?)

Cited In (23)

• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Independent spanning trees in crossed cubes
• Completely independent spanning trees in some regular graphs
• Symmetry properties of chordal rings of degree 3
• Separability of symmetric degree-four chordal ring networks
• Constructing independent spanning trees for locally twisted cubes
• Finding totally independent spanning trees with linear integer programming
• Construction independent spanning trees on locally twisted cubes in parallel
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Constructing node-independent spanning trees in augmented cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees on even networks
• Independent spanning trees on folded hyper-stars
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Completely independent spanning trees in torus networks
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• A note on isomorphic chordal rings
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Construction of optimal independent spanning trees on folded hypercubes
• Structural properties of subdivided-line graphs
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294645)