Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four Independent Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees on the star network with applications to fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees with small depths in iterated line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing edge-disjoint spanning trees in locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-pancyclicity and edge-pancyclicity of hypercube variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees of chordal rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity of locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Spanning Trees on Multidimensional Torus Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally twisted cubes are 4-pancyclic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank

Latest revision as of 20:10, 4 July 2024

scientific article
Language Label Description Also known as
English
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
scientific article

    Statements

    Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2012
    0 references
    independent spanning trees
    0 references
    edge-disjoint spanning trees
    0 references
    locally twisted cubes
    0 references
    interconnection networks
    0 references
    fault-tolerant broadcasting
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references