Strong matching preclusion for \(k\)-composition networks (Q1698726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hamiltonian decomposition of Cayley graphs of degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2799836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion of \((n,k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for two-dimensional torus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for \(n\)-dimensional torus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for \(n\)-dimensional torus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for vertex-transitive networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for balanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for torus 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: Strong matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 03:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Strong matching preclusion for \(k\)-composition networks
scientific article

    Statements

    Strong matching preclusion for \(k\)-composition networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 February 2018
    0 references
    strong matching preclusion
    0 references
    almost perfect matching
    0 references
    perfect matching
    0 references
    interconnection networks
    0 references

    Identifiers