Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some results on topological properties of folded hypercubes / 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: The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube / 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: 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: 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: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing one-to-many disjoint paths in folded 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: Independent spanning trees vs. edge-disjoint spanning trees in locally twisted 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: Q3114956 / 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: Constructing edge-disjoint spanning trees in 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 MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conditional diagnosability of the folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability of the folded hypercubes / rank
 
Normal rank

Revision as of 08:53, 4 July 2024

scientific article
Language Label Description Also known as
English
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
scientific article

    Statements

    Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2011
    0 references
    independent spanning trees
    0 references
    edge-disjoint spanning trees
    0 references
    folded hypercubes
    0 references
    interconnection networks
    0 references
    fault-tolerant broadcasting
    0 references
    0 references
    0 references

    Identifiers

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