Complexity of the circulant foliation over a graph (Q2025146)

From MaRDI portal
Revision as of 19:33, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of the circulant foliation over a graph
scientific article

    Statements

    title
    Complexity of the circulant foliation over a graph (English)
    0 references
    author
    Young Soo Kwon
    0 references
    Alexander Mednykh
    0 references
    Ilya A. Mednykh
    0 references
    publication date
    11 May 2021
    0 references
    zbMATH Keywords
    spanning trees
    0 references
    circulant graphs
    0 references
    Petersen graphs
    0 references
    \(I\)-graphs
    0 references
    Laplacian matrices
    0 references
    Chebyshev polynomials
    0 references
    cites work
    Q4101884
    0 references
    Q3757929
    0 references
    Q3838155
    0 references
    Q4791752
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C30
    0 references
    05C75
    0 references
    05C50
    0 references
    05C05
    0 references
    39A10
    0 references
    zbMATH DE Number
    7347320
    0 references
    OpenAlex ID
    W3009018281
    0 references
    arXiv ID
    1902.05681
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2025146&oldid=38837541"
    Powered by MediaWiki