Inverse Fiedler vector problem of a graph
From MaRDI portal
Cites work
- Absolute algebraic connectivity of trees
- An r-Dimensional Quadratic Placement Algorithm
- Characteristic vertices of trees*
- Characteristic vertices of weighted trees via perron values
- Construction of a Jacobi matrix from spectral data
- Drawing graphs by eigenvectors: theory and practice
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- Graphs and matrices
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Inverse eigenvalue problem for discrete Schrödinger operators of a graph
- Inverse eigenvalue problems for Jacobi matrices
- Inverse Problems and Zero Forcing for Graphs
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Minimizing Effective Resistance of a Graph
- On the Colin de Verdière numbers of Cartesian graph products
- On the construction of a Jacobi matrix from spectral data
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectra of graphs
- Spectral bisection of graphs and connectedness
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- The Parter--Wiener Theorem: Refinement and Generalization
This page was built for publication: Inverse Fiedler vector problem of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313440)