The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree (Q2945348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The nodal count \0,1,2,3,\ implies the graph is a tree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The nodal count \(\{0,1,2,3,\ldots\}\) 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
0.8156360387802124
0 references
0.812021791934967
0 references
0.8091275095939636
0 references
0.7977625131607056
0 references
0.783906877040863
0 references
