Constructing Node-Independent Spanning Trees in Augmented Cubes

DOI10.3233/FI-2020-1965zbMath1497.68050OpenAlexW3115429920MaRDI QIDQ4988941

Jianxi Fan, Guo Chen, Xiao-Yan Li, Baolei Cheng, Qiang Lyu, Cheng-Kuan Lin

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)

Related Items (1)

Parallel construction of multiple independent spanning trees on highly scalable datacenter networks

Cites Work

• Unnamed Item
• Independent spanning trees of chordal rings
• Conditional edge-fault pancyclicity of augmented cubes
• Edge-independent spanning trees in augmented cubes
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees on even networks
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Independent spanning trees on twisted cubes
• The super connectivity of augmented cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented 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\)
• The multi-tree approach to reliability in distributed networks
• Independent trees in planar graphs
• Independent trees in graphs
• Reliable broadcasting in product networks
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Independent spanning trees on folded hyper-stars
• Four Edge-Independent Spanning Trees
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Augmented cubes
• A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• Independent spanning trees in crossed cubes

This page was built for publication: Constructing Node-Independent Spanning Trees in Augmented Cubes