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

From MaRDI portal
Revision as of 21:42, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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