| 1. | 谷��，L. Guo |
|
| Generating functions from the viewpoint of Rota-Baxter algebras |
|
| Discrete Math. 338 (2015) 536--554 |
|
| 2. | å¼ å½ª |
|
| On the Real-rootedness of the Descent Polynomials of (n-2)-Stack Sortable Permutations |
|
| Electron. J. Combin. 22(4) (2015) #P4.12 |
|
| 3. | 郜��，�立波 |
|
| A bijective proof of the hook-length formula for standard immaculate tableaux |
|
| Proc. Amer. Math. Soc. |
|
| 4. | 侯庆虎，å™æ…§ï¼Œå¼ 莉 |
|
| Quadratic Forms and Congruences for ell-Regular Partitions Modulo 3, 5 and 7 |
|
| Adv. Appl. Math. |
|
| 5. | 陈永å·�，侯庆虎，å™æ…§ï¼Œå¼ 莉 |
|
| Ramanujan-type congruences for overpartitions modulo 16 |
|
| Ramanujan J. |
|
| 6. | 陈永å·�，éƒé¾™ï¼Œåºžå…´æ¢… |
|
| Vacillating Hecke tableaux and linked partitions |
|
| Math. Z. |
|
| 7. | æ�¨æ˜ 雪，钟欣欣，周大跑 |
|
| On the enumeration of (s, s + 1, s + 2)-core partitions |
|
| European J. Combin. |
|
| 8. | 陈永�，黄昊阳，王星炜 |
|
| Average size of a self-conjugate (s; t)-core partition |
|
| Proc. Amer. Math. Soc. |
|
| 9. | æ�Žå¦è‰¯ï¼ŒC. Magnant |
|
| Properly colored notions of connectivity - a dynamic survey |
|
| Theory & Appl. Graphs |
|
| 10. | J. Ma，å�²æ°¸å ‚，Z. Wang，J. Yue |
|
| On Wiener polarity index of bicyclic networks |
|
| Sci. Rep. |
|
| 11. | R.H. Li, Q. Fu, L.B. Guo, æ�Žå¦è‰¯ |
|
| Construction of quantum caps in projective space PG(r;4) and quantum codes of distance 4 |
|
| Quantum Inf. Process. |
|
| 12. | 江慧，æ�Žå¦è‰¯ï¼Œå¼ 莹莹，Y. Zhao |
|
| On (strong) proper vertex-connection of graphs |
|
| Bull. Malays. Math. Sci. Soc. |
|
| 13. | R.H. Li，æ�Žå¦è‰¯ï¼ŒL.B. Guo |
|
| On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound |
|
| Quantum Inf. Process. |
|
| 14. | 顾冉，æ�Žå¦è‰¯ï¼Œå�²æ°¸å ‚ |
|
| Hypergraph Turan numbers of vertex disjoint cycles |
|
| Acta Math. Appl. Sin. |
|
| 15. | L. Chen，æ�Žå¦è‰¯ï¼ŒM. Liu, Y. Mao |
|
| A solution to a conjecture on the generalized connectivity of graphs |
|
| J. Comb. Optim. |
|
| 16. | X. Chen， æ�Žå¦è‰¯ï¼ŒH. Lian |
|
| Rainbow k-connectivity of random bipartite graphs |
|
| Acta Math. Appl. Sin. |
|
| 17. | 顾冉，æ�Žå¦è‰¯ï¼Œè¦ƒå¿ 美 |
|
| Proper connection number of random graphs |
|
| Theoret. Comput. Sci. |
|
| 18. | 顾冉，æ�Žå¦è‰¯ï¼Œè¦ƒå¿ 美，Y. Zhao |
|
| More on the colorful monochromatic connectivity |
|
| Bull. Malays. Math. Sci. Soc. |
|
| 19. | æ�Žå¦è‰¯ï¼ŒY. Mao，é�美芹，R. Li |
|
| Searching for (near) optimal codes |
|
| LNCS (Proc. COCOA 2015) |
|
| 20. | æ�Žå¦è‰¯ï¼ŒY. Li，å�²æ°¸å ‚ |
|
| The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree |
|
| J. Math. Anal. Appl. |
|
| 21. | C.H. Li，路在平，G.X. Wang |
|
| On edge-transitive graphs of square-free order |
|
| Electron. J. Combin. 22 (2015) #P00 |
|
| 22. | 蔡庆ç�¼ï¼Œæ�Žå¦è‰¯ï¼ŒY. Zhao |
|
| Note on the upper bound of the rainbow index of a graph |
|
| Discrete Appl. Math. |
|
| 23. | æ�Žå¦è‰¯, Y. Mao, I. Gutman |
|
| The Steiner Wiener index of a graph |
|
| Discuss. Math. Graph Theory |
|
| 24. | Y. Sun, æ�Žå¦è‰¯ |
|
| On the difference of two generalized connectivities of a graph |
|
| J. Comb. Optim. |
|
| 25. | 陈ç�³ï¼Œåˆ˜é‡‘凤，å�²æ°¸å ‚ |
|
| Bounds on the matching energy of unicyclic odd-cycle graphs |
|
| MATCH Commun. Math. Comput. Chem. |
|
| 26. | 蔡庆ç�¼ï¼Œæ�Žå¦è‰¯ï¼Œå�´è¿ª |
|
| Erdos-Gallai-type results for colorful monochromatic connectivity of a graph |
|
| J. Comb. Optim. |
|
| 27. | 雷辉，�� |
|
| Bounds for the Sum-Balaban index and (revised) Szeged index of regular graphs |
|
| Appl. Math. Comput. |
|
| 28. | 陈�，刘金凤 |
|
| The bipartite unicyclic graphs with the first lfloor frac{n-3}{4} rfloor largest matching energies |
|
| Appl. Math. Comput. |
|
| 29. | æ�Žå¦è‰¯ï¼Œé�美芹，岳军 |
|
| Proper connection number and connected dominating sets |
|
| Theoret. Comput. Sci. |
|
| 30. | 黄飞，æ�Žå¦è‰¯ï¼ŒçŽ‹ä¹¦æ™¶ |
|
| On graphs with maximum Harary spectral radius |
|
| Appl. Math. Comput. |
|
| 31. | 顾冉，黄飞，æ�Žå¦è‰¯ |
|
| Skew Randic matrix and skew Randic energy |
|
| Trans. Combin. |
|
| 32. | H.S. Ramane, K.C. Nandeesh, I. Gutman, æ�Žå¦è‰¯ |
|
| Skew equienergetic digraphs |
|
| Trans. Combin. |
|
| 33. | æ�Žå¦è‰¯ï¼Œå�²æ°¸å ‚，M. Trinks |
|
| Polynomial reconstruction of the matching polynomial |
|
| Electron. J. Graph Theory Appl. 3(1)(2015) |
|
| 34. | 陈å°�林，æ�Žå¦è‰¯ï¼ŒH.S. Lian |
|
| The matching energy of random graphs |
|
| Discrete Appl. Math. |
|
| 35. | 陈å°�林，æ�Žå¦è‰¯ï¼ŒH.S. Lian |
|
| Lower bounds of the skew spectral radii and skew energy of oriented graphs |
|
| Linear Algebra Appl. |
|
| 36. | 江慧，æ�Žå¦è‰¯ï¼Œå¼ 莹莹 |
|
| Upper bounds for the total rainbow connection of graphs |
|
| J. Combin. Optim. |
|
| 37. | 陈å°�林，æ�Žå¦è‰¯ï¼ŒH.S. Lian |
|
| Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs |
|
| Electron. J. Combin.22(1)(2015) |
|
| 38. | æ�Žå¦è‰¯ï¼ŒçŽ‹å»ºé”‹ï¼ŒQ.X. Huang |
|
| On the Hermitian matrix with distinct eigenvalues and its applications |
|
| Acta Math. Sin. (in Chinese) |
|
| 39. | æ�Žå¦è‰¯ï¼Œè¦ƒå¿ 美，é�美芹，I. Gutman, M. Dehmer |
|
| Novel inequalities for generalized graph entropies--Graph energies and topological indices |
|
| Appl. Math. Comput. |
|
| 40. | I. Gutman, B. Furtula, æ�Žå¦è‰¯ |
|
| Multicenter Wiener indices and their applications |
|
| J. Serb. Chem. Soc. |
|
| 41. | S.S. Li, æ�Žå¦è‰¯ï¼Œå�²æ°¸å ‚ |
|
| Note on the complexity of deciding the rainbow (vertex-)connectedness for bipartite graphs |
|
| Appl. Math. Comput. |
|
| 42. | æ�Žå¦è‰¯ï¼Œé�美芹，S.C. Gong |
|
| A computer search for the borderenergetic graphs of order 10 |
|
| MATCH Commun. Math. Comput. Chem. |
|
| 43. | S.C. Gong，æ�Žå¦è‰¯ï¼ŒG.H. Xu，I. Gutman，B. Furtula |
|
| Borderenergetic graphs |
|
| MATCH Commun. Math. Comput. Chem. |
|
| 44. | 黄飞，æ�Žå¦è‰¯ï¼ŒçŽ‹ä¹¦æ™¶ |
|
| On maximum Laplacian Estrada indices of trees with some given parameters |
|
| MATCH Commun. Math. Comput. Chem. |
|
| 45. | Z.Q. Chen, M. Dehmer, å�²æ°¸å ‚，æ�¨å�Ž |
|
| Sharp upper bounds for the Balaban index of bicyclic graphs |
|
| MATCH Commun. Math. Comput. Chem. |
|
| 46. | 路在平，马迎宾 |
|
| Rainbow 2-Connection Numbers of Cayley Graphs |
|
| Inform. Process. Lett. |
|
| 47. | æ�Žå¦è‰¯ï¼Œæ¯›äºšå¹³ |
|
| Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs |
|
| Discrete Appl. Math. |
|
| 48. | æ�Žæ�’哲，æ�Žå¦è‰¯ï¼Œæ¯›äºšå¹³ï¼Œå²³å†› |
|
| Note on the spanning-tree packing number of lexicographic product graphs |
|
| Discrete Math. |
|
| 49. | é«˜ç»´ä¸œï¼ŒéŸ©å†¬æ˜¥ï¼Œå¼ æ±‰æ–Œ |
|
| The EGZ-constant and short zero-sum sequences over finite abelian groups |
|
| J. Number Theory |
|
| 50. | 高维东，Y.L. Li，P.Z. Yuan，J.J. Zhuang |
|
| On the structure of long zero-sum free sequences and n-zero-sum free sequences over finite cyclic groups |
|
| Arch. Math. 105(4) (2015), 361--370 |
|
| 51. | 高维东，Y.L. Li，赵��，J.J. Zhuang |
|
| On sequences over a finite abelian group with zero-sum subsequences of forbidden lengths |
|
| Colloq. Math. |
|
| 52. | 高维东，D.J. Grynkiewicz，X.W. Xia |
|
| On n-sums in an abelian group |
|
| Combin. Probab. Comput. |
|
| 53. | 韩冬春 |
|
| The Erdos–Ginzburg–Ziv theorem for finite nilpotent groups |
|
| Arch. Math. 104 (2015), 325--332 |
|
