A lower bound for nodal count on discrete and metric graphs (Q956633): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 18:41, 30 January 2024

scientific article
Language Label Description Also known as
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
    0 references
    25 November 2008
    0 references

    Identifiers