The nodal count {0,1,2,3,…} implies the graph is a tree (Q2945348)

From MaRDI portal
Revision as of 01:17, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The nodal count {0,1,2,3,…} implies the graph is a tree
scientific article

    Statements

    The nodal count {0,1,2,3,…} implies the graph is a tree (English)
    0 references
    0 references
    9 September 2015
    0 references
    Sturm-Liouville problems
    0 references
    quantum graphs
    0 references
    inverse spectral problems
    0 references
    nodal data
    0 references

    Identifiers