The following pages link to Abraham Berman (Q269248):
Displaying 50 items.
- SPN completable graphs (Q269250) (← links)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- (Q389552) (redirect page) (← links)
- On the higher moments of TCP (Q389554) (← links)
- On the uniqueness of the Lyapunov scaling factors (Q581506) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- Completely positive house matrices (Q648914) (← links)
- Characterization of completely positive graphs (Q685688) (← links)
- Positive matrices associated with synchronised communication networks (Q703620) (← links)
- \(5 \times 5\) completely positive matrices (Q703621) (← links)
- Notes on \(\omega\)- and \(\tau\)-matrices (Q795895) (← links)
- Characterization of acyclic D-stable matrices (Q795896) (← links)
- A note on the computation of the CP-rank (Q854849) (← links)
- (Q947625) (redirect page) (← links)
- An upper bound for the minimum rank of a graph (Q947626) (← links)
- Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers (Q1010731) (← links)
- Localization of the spectra of \(P\)- and \(P_0\)-matrices (Q1052425) (← links)
- Linear transformations that preserve certain positivity classes of matrices (Q1070008) (← links)
- Cone reachability for nondiagonable linear differential systems (Q1076875) (← links)
- Matrices with a transitive graph and inverse M-matrices (Q1084412) (← links)
- Haifa 1985 conference on matrix theory (Q1085237) (← links)
- Combinatorial results on completely positive matrices (Q1091401) (← links)
- Nonnegative generalized inverses of powers of non-negative matrices (Q1106288) (← links)
- Complete positivity (Q1106295) (← links)
- More on the uniqueness of the Lyapunov scaling factors (Q1112919) (← links)
- Cross-cloning and antipodal graphs (Q1117249) (← links)
- Report: Haifa 1988 conference on matrix theory (Q1120634) (← links)
- Matrices and the linear complementarity problem (Q1154944) (← links)
- Matrices with zero line sums and maximal rank (Q1160688) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- More on extremal positive semidefinite doubly stochastic matrices (Q1187505) (← links)
- Haifa 1990 conference on matrix theory (Q1187520) (← links)
- Nonnegative matrices which are equal to their generalized inverse (Q1219931) (← links)
- Eight types of matrix monotonicity (Q1231539) (← links)
- The length of a (0,1) matrix (Q1248528) (← links)
- Classes of stable and semipositive matrices (Q1249629) (← links)
- On Tucker's key theorem (Q1250026) (← links)
- \(\mathcal A\mathcal L\wp\mathcal S\): Matrices with nonpositive off-diagonal entries (Q1255074) (← links)
- Lower bounds for the eigenvalues of Laplacian matrices (Q1587270) (← links)
- Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum (Q1715835) (← links)
- A family of graphs that are determined by their normalized Laplacian spectra (Q1748074) (← links)
- \(\{0,1\}\) completely positive matrices (Q1772719) (← links)
- Similarity classes and principal submatrices (Q1779401) (← links)
- On the spectral radius of graphs with cut vertices (Q1850564) (← links)
- Bipartite density of cubic graphs (Q1861239) (← links)
- The maximal cp-rank of rank \(k\) completely positive matrices (Q1870038) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← links)
- Polynomial values in Fibonacci sequences (Q2036665) (← links)
- Triangle-free graphs and completely positive matrices (Q2155141) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
