Spectral graph theory and the inverse eigenvalue problem of a graph.
A note on minimum rank and maximum nullity of sign patterns.
A variant on the graph parameters of Colin de Verdière: implications to the minimum rank of graphs.
The (weakly) sign symmetric -matrix completion problems.
The -matrix completion problem.
Sign patterns that require eventual positivity or require eventual nonnegativity.
The -matrix completion problem.
Sign patterns that require or allow power-positivity.
Universally optimal matrices and field independence of the minimum rank of a graph.
Minimum rank of a tree over an arbitrary field.
Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers.
The nonnegative -matrix completion problem.
On the minimum rank of not necessarily symmetric matrices: a preliminary study.
Sign patterns that allow eventual positivity.
Page 1