A characterization of tridiagonal matrices
From MaRDI portal
Publication:2538694
DOI10.1016/0024-3795(69)90027-5zbMath0194.06105OpenAlexW2062428937MaRDI QIDQ2538694
Publication date: 1969
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(69)90027-5
Related Items
Subgraph complementation and minimum rank, Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph, Rank-preserving diagonal completions of a matrix, The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, Computation of minimal rank and path cover number for certain graphs, Maximum nullity of outerplanar graphs and the path cover number, The inertia set of a signed graph, Some possible new directions for combinatorial matrix analysis, On the minimum rank of the join of graphs and decomposable graphs, Controllability of NEPSes of graphs, The strong spectral property for graphs, Acyclic matrices with a small number of distinct eigenvalues, On the graph complement conjecture for minimum rank, Signed graphs with maximum nullity two, Completely positive house matrices, Three-connected graphs whose maximum nullity is at most three, The structure of matrices with a maximum multiplicity eigenvalue, Two-connected signed graphs with maximum nullity at most two, A zero forcing technique for bounding sums of eigenvalue multiplicities, The maximum corank of graphs with a 2-separation, Techniques for determining the minimum rank of a small graph, On a characterization of tridiagonal matrices by M. Fiedler, On the inverse of the adjacency matrix of a graph, On Fiedler's characterization of tridiagonal matrices over arbitrary fields, The minimum rank of symmetric matrices described by a graph: a survey, The minimum rank problem over the finite field of order 2: Minimum rank 3, The rank of reduced dispersion matrices, Unnamed Item, The graphs for which the maximum multiplicity of an eigenvalue is two, On the minimum rank of a graph over finite fields, On symmetric matrices with indeterminate leading diagonals, On the rank spread of graphs
Cites Work
