A note on the strong matching preclusion problem for data center networks (Q2203600): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4636192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378287 / 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: The pessimistic diagnosability of data center networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Menger connectedness of data center network and \((n,k)\)-star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional fault Hamiltonicity of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional fault hamiltonian connectivity of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for \(k\)-composition networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge-connectivity and matching preclusion of data center networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion under the conditional fault model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge-fault-tolerant Hamiltonicity of the data center network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted \(h\)-connectivity of the data center network DCell / rank
 
Normal rank

Latest revision as of 18:34, 23 July 2024

scientific article
Language Label Description Also known as
English
A note on the strong matching preclusion problem for data center networks
scientific article

    Statements

    A note on the strong matching preclusion problem for data center networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    matching
    0 references
    strong matching preclusion
    0 references
    data center network
    0 references
    fault tolerance
    0 references
    0 references