Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2287547725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of the hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-path-bipanconnectivity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity and edge-pancyclicity of<i>k</i>-ary<i>n</i>-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 04:46, 11 July 2024

scientific article
Language Label Description Also known as
English
Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
scientific article

    Statements

    Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (English)
    0 references
    8 December 2015
    0 references
    paired disjoint path cover
    0 references
    fault-tolerance
    0 references
    \(k\)-ary \(n\)-cube
    0 references
    Cartesian product of graphs
    0 references
    interconnection network
    0 references
    0 references

    Identifiers

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