Liang-Hao Huang
Computational Theory and Mathematics · with Chang · 2010–2012
A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 17 citations into it
- Geometry and Topology — 16 citations into it
- Organic Chemistry — 8 citations into it
Whom Liang-Hao Huang trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Liang-Hao Huang's perspective
Ordered by how strongly the researchers Liang-Hao Huang trusts endorse each paper. Same corpus, a different order for every researcher.
- A characterization of singular graphs
- An upper bound for the minimum rank of a graph
- Trees with maximum nullity
- 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
- The minimum rank of symmetric matrices described by a graph: A survey☆
- Which graphs are determined by their spectrum
- Algebraic connectivity of graphs
- Algebraic Graph Theory
- Energy of a Graph
Their papers
- A characterization of graphs with rank 5 (2012) — 77 citations
- A characterization of graphs with rank 4 (2011) — 86 citations
- On minimum rank and zero forcing sets of a graph (2010) — 74 citations