Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 4
Distinct eigenvalues are realizable with generic eigenvectors
Rupert H. Levene, Polona Oblak, Helena Šmigoc
Izvirni znanstveni članek
Oznake: simetrična matrika;spoj grafov;inverzni problem lastnih vrednosti;najmanjše število različnih lastnih vrednosti;symmetric matrix;join of graphs;inverse eigenvalue problem;minimal number of distinct eigenvalues;
Motivated by applications in matrix constructions used in the inverse eigenvalue problem for graphs, we study a concept of genericity for eigenvectors associated with a given spectrum and a connected graph. This concept generalizes the established notion of a nowhere-zero eigenbasis. Given any simpl ...
Leto: 2023 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Orthogonalisability of joins of graphs
Rupert H. Levene, Polona Oblak, Helena Šmigoc
Izvirni znanstveni članek
Oznake: simetrična matrika;ortogonalna matrika;najmanjše število različnih lastnih vrednosti;spoj grafov;inverzni problem lastnih vrednosti;symmetric matrix;orthogonal matrix;inverse eigenvalue problem;minimum number of distinct eigenvalues;join of graphs;
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the connected components of two graphs for their join to be ort ...
Leto: 2025 Vir: Repozitorij Univerze v Ljubljani (RUL)
Spectral arbitrariness for trees fails spectacularly
Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak, Helena Šmigoc
Izvirni znanstveni članek
Oznake: spekter;seznam večkratnosti;drevo s korenom;inverzni problem lastnih vrednosti za graf;spectrum;multiplicity lists;rooted trees;hedges;inverse eigenvalue problem for graphs;
Given a graph G, consider the family of real symmetric matrices with the property that the pattern of their nonzero off-diagonal entries corresponds to the edges of G. For the past 30 years a central problem has been to determine which spectra are realizable in this matrix class. Using combinatorial ...
Leto: 2024 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
Aida Abiad, Shaun M. Fallat, Mark Kempton, Rupert H. Levene, Polona Oblak, Helena Šmigoc, Michael Tait, Kevin N. Vander Meulen
Izvirni znanstveni članek
Oznake: inverzni problem lastnih vrednosti;najmanjše število različnih lastnih vrednosti;ograjevanje;spoj grafov;poti;cikli;hiperkocke;inverse eigenvalue problem;minimum number of distinct eigenvalues;borderings;joins of graphs;paths;cycles;hypercubes;
Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
Leto: 2023 Vir: Digitalni repozitorij raziskovalnih organizacij Slovenije
Št. zadetkov: 4
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: