Independent spanning trees on twisted cubes (Q663434): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60402383, #quickstatements; #temporary_batch_1706897434465
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiao-Hua Jia / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Hua Jia / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2011.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079922756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of twisted cube / 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: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges / 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: Efficient unicast in bijective connection networks with the restricted faulty node set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal fault-tolerant embedding of paths in twisted cubes / 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 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: Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults / 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: Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant Hamiltonicity of twisted cubes / 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: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a family of meshes into twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of tori and grids into twisted cubes / 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: Q4232798 / 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: Hamiltonian properties of twisted hypercube-like networks with more faulty elements / 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 22:49, 4 July 2024

scientific article
Language Label Description Also known as
English
Independent spanning trees on twisted cubes
scientific article

    Statements

    Independent spanning trees on twisted cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    broadcasting
    0 references
    independent spanning tree
    0 references
    fault tolerance
    0 references
    twisted cube
    0 references
    0 references
    0 references
    0 references
    0 references