Complexity of the circulant foliation over a graph (Q2025146): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10801-019-00921-7 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10801-019-00921-7 / rank
 
Normal rank

Latest revision as of 19:33, 16 December 2024

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