Strong matching preclusion for \(k\)-ary \(n\)-cubes (Q2446897): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.dam.2013.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140523929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings after vertex deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee distance and topological properties of k-ary n-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional matching preclusion sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion for regular interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in pruned grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional matching preclusion for hypercube-like interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for \(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

Latest revision as of 10:05, 8 July 2024

scientific article
Language Label Description Also known as
English
Strong matching preclusion for \(k\)-ary \(n\)-cubes
scientific article

    Statements

    Strong matching preclusion for \(k\)-ary \(n\)-cubes (English)
    0 references
    0 references
    0 references
    0 references
    23 April 2014
    0 references
    interconnection networks
    0 references
    \(k\)-ary \(n\)-cubes
    0 references
    perfect and almost perfect matchings
    0 references
    strong matching preclusion
    0 references

    Identifiers

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