Strong matching preclusion number of graphs (Q1694672)

From MaRDI portal
Revision as of 02:39, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Strong matching preclusion number of graphs
scientific article

    Statements

    title
    Strong matching preclusion number of graphs (English)
    0 references
    author
    Yaping Mao
    0 references
    Zhao Wang
    0 references
    Eddie Cheng
    0 references
    Christopher Melekian
    0 references
    publication date
    6 February 2018
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C82
    0 references
    68R10
    0 references
    zbMATH DE Number
    6834898
    0 references
    zbMATH Keywords
    interconnection networks
    0 references
    perfect matching
    0 references
    strong matching preclusion number
    0 references
    OpenAlex ID
    W2781705660
    0 references
    Wikidata QID
    Q56638368
    0 references
    cites work
    Q3258698
    0 references
    Q5422499
    0 references
    Q3378287
    0 references
    Q3015671
    0 references
    Q3544998
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1694672&oldid=36370045"
    Powered by MediaWiki