Constructing node-independent spanning trees in augmented cubes

DOI10.3233/FI-2020-1965MaRDI QIDQ4988941zbMATH OpenOpenAlexFDO

Authors Baolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Guo Chen

Publication date 20 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1965

zbMATH Keywords

augmented cubesconstructive algorithmsecure message distributionnode-independent 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

• Edge-independent spanning trees in augmented cubes
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Independent spanning trees in crossed cubes
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees on twisted cubes

Cites work

• scientific article; zbMATH DE number 1322340 (Why is no real title available?)
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Augmented cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• Conditional edge-fault pancyclicity of augmented cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Constructing independent spanning trees for locally twisted cubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Edge-independent spanning trees in augmented cubes
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Four edge-independent spanning trees
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
• Independent Spanning Trees on Multidimensional Torus Networks
• Independent spanning trees in crossed cubes
• Independent spanning trees of chordal rings
• Independent spanning trees on even networks
• Independent spanning trees on folded hyper-stars
• Independent spanning trees on twisted cubes
• Independent trees in graphs
• Independent trees in planar graphs
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Reliable broadcasting in product networks
• The multi-tree approach to reliability in distributed networks
• The super connectivity of augmented cubes
• Three tree-paths

Cited in

(3)

• Edge-independent spanning trees in augmented cubes
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• An improved algorithm to construct edge-independent spanning trees in augmented cubes

This page was built for publication: Constructing node-independent spanning trees in augmented cubes

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