Inertia sets for graphs on six or fewer vertices
From MaRDI portal
Publication:3559089
DOI10.13001/1081-3810.1357zbMath1189.05048OpenAlexW1912618477MaRDI QIDQ3559089
No author found.
Publication date: 11 May 2010
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/223665
graphinertiasymmetricminimum rankHermitianinverse inertia problemcombinatorial matrix theorybalanced inertia
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Minimum rank of outerplanar graphs ⋮ Computing inertia sets using atoms ⋮ The inertia set of the join of graphs ⋮ Unicyclic graphs and the inertia of the squared distance matrix ⋮ Unnamed Item ⋮ Graphs that allow all the eigenvalue multiplicities to be even ⋮ On the computation of edit distance functions
This page was built for publication: Inertia sets for graphs on six or fewer vertices