A lower bound for nodal count on discrete and metric graphs (Q956633)
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: A lower bound for nodal count on discrete and metric graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for nodal count on discrete and metric graphs |
scientific article |
Statements
A lower bound for nodal count on discrete and metric graphs (English)
0 references
25 November 2008
0 references
0.8459579944610596
0 references
0.824384331703186
0 references
0.8193258047103882
0 references
0.8162662386894226
0 references
0.8148021101951599
0 references
