Christina Edholm

Computational Theory and Mathematics · 2012

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Christina Edholm trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Francesco Barioli
  2. Leslie Hogben
  3. Shaun M. Fallat

Papers from Christina Edholm's perspective

Ordered by how strongly the researchers Christina Edholm trusts endorse each paper. Same corpus, a different order for every researcher.

  1. On the minimum rank of not necessarily symmetric matrices : a preliminary study
  2. Minimum Rank Problems
  3. Zero forcing parameters and minimum rank problems
  4. A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
  5. An upper bound for the minimum rank of a graph
  6. On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
  7. A technique for computing the zero forcing number of a graph with a cut-vertex
  8. The minimum rank of symmetric matrices described by a graph: A survey☆
  9. Linearly independent vertices and minimum semidefinite rank
  10. Graphs whose positive semi-definite matrices have nullity at most two

Their papers