Gerard Jennhwa Chang

Computational Theory and Mathematics · 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 Gerard Jennhwa Chang trusts overall

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

1. Bolian Liu
2. Leslie Hogben

Papers from Gerard Jennhwa Chang's perspective

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

1. A characterization of singular graphs
2. Trees with maximum nullity
3. On the nullity of bicyclic graphs
4. An upper bound for the minimum rank of a graph
5. Which graphs are determined by their spectrum
6. Comparing Zagreb Indices of Cyclic Graphs
7. On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
8. An always nontrivial upper bound for Laplacian graph eigenvalues
9. Eigenvalues of the Laplacian of a graph
10. Algebraic connectivity of graphs

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