An improved algorithm to construct edge-independent spanning trees in augmented cubes
DOI10.1016/j.dam.2019.09.021zbMath1435.05049OpenAlexW2981283987WikidataQ126998879 ScholiaQ126998879MaRDI QIDQ2306584
Cheng-Kuan Lin, Baolei Cheng, Guijuan Wang, Jianxi Fan, Yan Wang
Publication date: 23 March 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.09.021
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Cites Work
- 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
- An efficient algorithm to construct disjoint path covers of DCell networks
- 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
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- 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: An improved algorithm to construct edge-independent spanning trees in augmented cubes
