Path-connectivity of lexicographic product graphs (Q2804863)

From MaRDI portal
Revision as of 22:57, 11 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
Path-connectivity of lexicographic product graphs
scientific article

    Statements

    title
    Path-connectivity of lexicographic product graphs (English)
    0 references
    author
    Yaping Mao
    0 references
    publication date
    6 May 2016
    0 references
    Mathematics Subject Classification ID
    05C05
    0 references
    05C40
    0 references
    05C70
    0 references
    05C76
    0 references
    zbMATH DE Number
    6577935
    0 references
    zbMATH Keywords
    connectivity
    0 references
    internally disjoint paths connecting \(S\)
    0 references
    packing
    0 references
    path-connectivity
    0 references
    lexicographic product
    0 references
    OpenAlex ID
    W1977150107
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2804863&oldid=36247342"
    Powered by MediaWiki