Discrete nodal domain theorems (Q5954844): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3344779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenfunctions and nodal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4299057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999241 / 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: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / 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: Q5802159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Courant's Nodal Line Theorem and Its Discrete Counterparts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplitude Spectra of Fitness Landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning by eigenvectors / rank
 
Normal rank

Revision as of 21:39, 3 June 2024

scientific article; zbMATH DE number 1702091
Language Label Description Also known as
English
Discrete nodal domain theorems
scientific article; zbMATH DE number 1702091

    Statements

    Discrete nodal domain theorems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 August 2002
    0 references
    In the setting of signed graphs, the authors present two discrete analogues of Courant's nodal domain theorem.
    0 references
    nodal domain
    0 references
    signed graph
    0 references
    Laplacian
    0 references
    eigenfunctions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references