![]() | ![]() |
| 2010 | ||
|---|---|---|
| 4 | Jianxi Li, Wai Chee Shiu, An Chang: The number of spanning trees of a graph. Appl. Math. Lett. 23(3): 286-290 (2010) | |
| 2007 | ||
| 3 | Wai Chee Shiu, An Chang: On the kth Eigenvalues of Trees with Perfect Matchings. Discrete Mathematics & Theoretical Computer Science 9(1): (2007) | |
| 2003 | ||
| 2 | An Chang: On the largest eigenvalue of a tree with perfect matchings. Discrete Mathematics 269(1-3): 45-63 (2003) | |
| 2001 | ||
| 1 | Qiongxiang Huang, An Chang: Circulant digraphs determined by their spectra. Discrete Mathematics 240(1-3): 261-270 (2001) | |
| 1 | Qiongxiang Huang | [1] |
| 2 | Jianxi Li | [4] |
| 3 | Wai Chee Shiu | [3] [4] |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page