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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nodal domains on isospectral quantum graphs: the resolution of isospectrality? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4299057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5820676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete nodal domain theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perron-Frobenius type results and discrete versions of nodal domain theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genericity of simple eigenvalues for a metric graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric aspects of graphs and their eigenfunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolving isospectral ‘drums’ by counting nodal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal counting on quantum graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic orbit theory and spectral statistics for quantum graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph models for waves in thin structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on courant's nodal line theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The qualitative Sturm-Liouville theory on spatial networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue and nodal properties on quantum graph trees* / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete nodal domain theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank

Latest revision as of 20:14, 28 June 2024

scientific article
Language Label Description Also known as
English
A lower bound for nodal count on discrete and metric graphs
scientific article

    Statements

    Identifiers