The nodal count {0,1,2,3,…} implies the graph is a tree (Q2945348): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Remarks on courant's nodal line theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can One Hear the Shape of a Drum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal domains of a non-separable problem—the right-angled isosceles triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of nodal points and the nodal count on a family of quantum graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can One Count the Shape of a Drum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse nodal problems / 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 domain counts and the chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nodal count for flat tori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isospectral graphs with identical nodal counts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal domains and spectral minimal partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of nodal domains on quantum graphs as a stability index of graph partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical partitions and nodal deficiency of billiard eigenfunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal count of graph eigenfunctions via magnetic perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magnetic interpretation of the nodal defect on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermitian symplectic geometry and extension theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kirchhoff's rule for quantum wires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum graphs: I. Some basic structures / 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: Eigenvalue and nodal properties on quantum graph trees* / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for nodal count on discrete and metric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete nodal domain theorems / 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: On the level spacing distribution in quantum graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of the continuous Laplacian on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of Schrödinger operators on equilateral quantum graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace formulae for quantum graphs with edge potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Laplacians and topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can one hear the shape of a graph? / rank
 
Normal rank

Latest revision as of 17:37, 10 July 2024

scientific article
Language Label Description Also known as
English
The nodal count {0,1,2,3,…} 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
    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

    Identifiers