Paired many-to-many disjoint path covers in faulty hypercubes (Q391966): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244600 / rank
 
Normal rank
Property / zbMATH Keywords
 
disjoint path cover
Property / zbMATH Keywords: disjoint path cover / rank
 
Normal rank
Property / zbMATH Keywords
 
hypercube
Property / zbMATH Keywords: hypercube / rank
 
Normal rank
Property / zbMATH Keywords
 
fault tolerance
Property / zbMATH Keywords: fault tolerance / rank
 
Normal rank
Property / zbMATH Keywords
 
strongly Hamiltonian laceability
Property / zbMATH Keywords: strongly Hamiltonian laceability / rank
 
Normal rank
Property / zbMATH Keywords
 
graph theory
Property / zbMATH Keywords: graph theory / 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.tcs.2013.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010322858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning multi-paths in hypercubes / 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: Paired many-to-many disjoint path covers of hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles with Prescribed Edges in 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: Long paths and cycles in hypercubes with faulty vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant cycle embedding in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in hypercubes with vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-laceability of star graphs / 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 embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults / 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: Hamiltonian properties on the class of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in faulty star graphs / 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: Fault-tolerant Hamiltonian laceability of hypercubes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear array and ring embeddings in conditional faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant cycles embedded in hypercubes with mixed link and node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a ring in a hypercube with both faulty links and faulty nodes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Paired many-to-many disjoint path covers in faulty hypercubes
scientific article

    Statements

    Paired many-to-many disjoint path covers in faulty hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    disjoint path cover
    0 references
    hypercube
    0 references
    fault tolerance
    0 references
    strongly Hamiltonian laceability
    0 references
    graph theory
    0 references
    0 references
    0 references