Bit-Shun Tam

Computational Theory and Mathematics · 2008–2015

A researcher in the Science corpus: 3 papers; trusts 4 researchers and is trusted by 3 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 11 citations into it; #7,721 of 12,182 by trust here, #5,954 by citations
• Geometry and Topology — 11 citations into it; #4,833 of 7,422 by trust here, #3,228 by citations
• Organic Chemistry — 8 citations into it; #926 of 1,495 by trust here, #1,367 by citations

Whom Bit-Shun Tam trusts overall

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

1. Yaoping Hou
2. Yi-Zheng Fan
3. Xiaodong Zhang
4. E. V. Dam

Who trusts Bit-Shun Tam overall

1. Dragos M. Cvetkovic
2. Slobodan K. Simic

Papers from Bit-Shun Tam's perspective

Ordered by how strongly the researchers Bit-Shun Tam trusts endorse each paper. Same corpus, a different order for every researcher.

1. Which graphs are determined by their spectrum
2. On the Laplacian Eigenvalues of Signed Graphs
3. The Laplacian spectrum of a mixed graph
4. On Spectral Integral Variations of Graphs
5. Signless Laplacians of finite graphs
6. Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
7. An always nontrivial upper bound for Laplacian graph eigenvalues
8. A note on the second largest eigenvalue of the laplacian matrix of a graph
9. Algebraic connectivity of graphs
10. The complement of the path is determined by its spectrum

Their papers

• Unoriented Laplacian maximizing graphs are degree maximal (2008) — 55 citations
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order (2008) — 69 citations
• A characterization of graphs G with nullity |V(G)|–2m(G)＋2c(G) (2015) — 50 citations