Complexity of the circulant foliation over a graph (Q2025146)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of the circulant foliation over a graph
scientific article

    Statements

    Complexity of the circulant foliation over a graph (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    spanning trees
    0 references
    circulant graphs
    0 references
    Petersen graphs
    0 references
    \(I\)-graphs
    0 references
    Laplacian matrices
    0 references
    Chebyshev polynomials
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references