Yaoping Hou
Computational Theory and Mathematics · 2001–2007
A researcher in the Science corpus: 8 papers; trusts 2 researchers and is trusted by 22 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 9 citations into it; #2,736 of 12,182 by trust here, #3,924 by citations
- Geometry and Topology — 8 citations into it; #1,057 of 7,422 by trust here, #1,050 by citations
Whom Yaoping Hou trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Yaoping Hou overall
- Ivan Gutman
- Nathan Reff
- Claudio Altafini
- J´erˆome Kunegis
- Yi-Zheng Fan
- Ismael Peña
- Thomas Zaslavsky
- Bo Zhou
- Xueliang Li
- Bit-Shun Tam
Papers from Yaoping Hou's perspective
Ordered by how strongly the researchers Yaoping Hou trusts endorse each paper. Same corpus, a different order for every researcher.
- Algebraic connectivity of graphs
- An always nontrivial upper bound for Laplacian graph eigenvalues
- A note on the second largest eigenvalue of the laplacian matrix of a graph
- Unicyclic Graphs with Minimal Energy
- The complement of the path is determined by its spectrum
- Bicyclic graphs with minimum energy
- Which graphs are determined by their spectrum
- On the Laplacian Eigenvalues of Signed Graphs
- Linear Programming and Extensions
- Computing the norm ∥A∥∞,1 is NP-hard
Their papers
- Bounds on the largest eigenvalues of trees with a given size of matching (2002) — 85 citations
- On the Laplacian Eigenvalues of Signed Graphs (2003) — 160 citations
- Bounds for the Least Laplacian Eigenvalue of a Signed Graph (2005) — 80 citations
- Graph Zn and some graphs related to Zn are determined by their spectrum (2005) — 62 citations
- Unicyclic graphs with maximal energy (2002) — 95 citations
- EQUIENERGETIC BIPARTITE GRAPHS (2007) — 55 citations
- Unicyclic Graphs with Minimal Energy (2001) — 120 citations
- Bicyclic graphs with minimum energy (2001) — 58 citations