Independent spanning trees in crossed cubes (Q5971214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60402302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
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: Topological properties of the crossed cube architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-pancyclicity and path-embeddability of bijective connection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles in twisted cubes with edge-pancyclic / 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: 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: Independent trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in planar graphs / 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: Independent spanning trees on even networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of the crossed cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding binary trees into crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing independent spanning trees for locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS / 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: Independent spanning trees on twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees on folded hyper-stars / 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 edge-disjoint spanning trees in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank

Latest revision as of 09:46, 8 July 2024

scientific article; zbMATH DE number 6286231
Language Label Description Also known as
English
Independent spanning trees in crossed cubes
scientific article; zbMATH DE number 6286231

    Statements

    Independent spanning trees in crossed cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    crossed cube
    0 references
    independent spanning trees
    0 references
    internally vertex-disjoint paths
    0 references
    fault-tolerant broadcasting
    0 references
    0 references

    Identifiers

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