Bryan L. Shader
Computational Theory and Mathematics · 2002–2010
A researcher in the Science corpus: 5 papers; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 15 citations into it
Whom Bryan L. Shader trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Bryan L. Shader overall
Papers from Bryan L. Shader's perspective
Ordered by how strongly the researchers Bryan L. Shader trusts endorse each paper. Same corpus, a different order for every researcher.
- An upper bound for the minimum rank of a graph
- Graphs whose positive semi-definite matrices have nullity at most two
- The minimum rank of symmetric matrices described by a graph: A survey☆
- Linearly independent vertices and minimum semidefinite rank
- GRAPHS WHOSE MINIMAL RANK IS TWO
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Laplacian energy of a graph
- Probabilistic reasoning in intelligent systems: Networks of plausible inference
- Archimedean copulae and positive dependence
Their papers
- An upper bound for the minimum rank of a graph (2008) — 65 citations
- Zero forcing parameters and minimum rank problems (2010) — 237 citations
- On the minimum rank of not necessarily symmetric matrices : a preliminary study (2009) — 55 citations
- On graphs with equal algebraic and vertex connectivity (2002) — 83 citations
- Minimum rank of skew-symmetric matrices described by a graph (2010) — 60 citations