The nodal count {0,1,2,3,…} implies the graph is a tree (Q2945348): Difference between revisions
From MaRDI portal
Latest revision as of 17:37, 10 July 2024
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
9 September 2015
0 references
Sturm-Liouville problems
0 references
quantum graphs
0 references
inverse spectral problems
0 references
nodal data
0 references
0 references
0 references