Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph.
From MaRDI portal
Publication:6584367
Cites work
- scientific article; zbMATH DE number 5841869 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A matrix inverse eigenvalue problem and its application
- An inverse eigenvalue problem for the finite element model of a vibrating rod
- Extremal inverse eigenvalue problem for bordered diagonal matrices
- Inverse Eigenvalue Problems
- Inverse Problems in Vibration
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- Inverse eigenvalue problems associated with spring-mass systems
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- Inverse eigenvalue problems for two special acyclic matrices
- Inverse maximal eigenvalues problems for Leslie and doubly Leslie matrices
- Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
- On the ABC spectra radius of unicyclic graphs
- Properly colored connectivity of graphs
- The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
- Two inverse eigenproblems for symmetric doubly arrow matrices
- Two inverse eigenvalue problems for a special kind of matrices
This page was built for publication: Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584367)
