Independent spanning trees of chordal rings

DOI10.1016/S0020-0190(98)00205-1MaRDI QIDQ294645zbMATHOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1322340 (Why is no real title available?)
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Independent trees in graphs
• On independent spanning trees
• Output-sensitive reporting of disjoint paths
• The multi-tree approach to reliability in distributed networks
• Three tree-paths

Cited in

(23)

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

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)