Independent spanning trees of product graphs

DOI10.1007/3-540-62559-3_27MaRDI QIDQ6550556zbMATH OpenFDO

Authors Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62559-3_27

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in some regular graphs
• Reliable broadcasting in product networks
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)

Cites work

• Broadcasting in hypercubes with randomly distributed Byzantine faults
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• On independent spanning trees
• The multi-tree approach to reliability in distributed networks
• Three tree-paths

This page was built for publication: Independent spanning trees of product graphs

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