On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
From MaRDI portal
Publication:2203118
DOI10.1007/s11253-020-01768-zzbMath1448.05133OpenAlexW3046101392MaRDI QIDQ2203118
Publication date: 1 October 2020
Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11253-020-01768-z
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
On multiplicities of eigenvalues of a spectral problem on a prolate tree, Upper bound for the diameter of a tree in the quantum graph theory, Inverse spectral problem for a star graph of Stieltjes strings with given numbers of masses on the edges, On inverse problem for tree of Stieltjes strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mechanical vibration trees
- On multiplicities of eigenvalues of a boundary value problem on a snowflake graph
- Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings
- One Can Hear the Composition of a String: Experiments with an Inverse Eigenvalue Problem
- Matrix Inverse Eigenvalue Problems
- CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
- Existence of a tree of Stieltjes strings corresponding to two given spectra
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- Spectral graph theory and the inverse eigenvalue problem of a graph
- On Properties of Large Wave Effect in Classical Problem of Bead String Vibration
- Location and multiplicities of eigenvalues for a star graph of Stieltjes strings
- Minimum number of distinct eigenvalues of graphs