2003年接��表论文29篇
| 1. | éƒå†›ä¼Ÿ | |
| The q-binomial theorem and two symmetric q-identities | ||
| Electron. J. Combin. 10 (2003), Research Paper 34, 8 pp. (electronic). | ||
| 2. | 陈永�，阎国光，�立波 | |
| The Skew Schubert polynomials | ||
| European J. Combin. 25 (2004), No.8, 1181--1196. | ||
| 3. | Z. Ji，S.J. Li，X.Q. Mou，�立波，J.H. Zhang | |
| Problems with a probabilistic encryption scheme based on chaotic systems | ||
| Internat. J. Bifur. Chaos Appl. Sci. Engrg. 13 (2003), No.10, 3063--3077 | ||
| 4. | �乔良 | |
| On weights in duadic abelian codes | ||
| Discrete Math. 260 (2003), No.1-3, 223--230 | ||
| 5. | �乔良 | |
| Note on regular D-optimal matrices | ||
| Chinese Ann. Math. Ser. B 24 (2003), No.2, 215--220 | ||
| 6. | D.R. Lick，刘�强 | |
| On λ-fold equipartite oberw6 olfach problem with uniform table sizes | ||
| Ann. Comb. 7 (2003), No.3, 315--323 | ||
| 7. | 陈永�，邓玉平，�丽� | |
| Motzkin paths and reduced decompositions for permutations with forbidden patterns | ||
| Electron. J. Combin. 9 (2002/03), No.2 | ||
| 8. | R. Xu，于�林 | |
| Ore-type conditions for the existence of k-factors with prescribed properties. | ||
| Congr. Numer. 162 (2003), 97--109 | ||
| 9. | R. Xu，于�林 | |
| Degree-sum conditions for k-extendable graphs | ||
| Congr. Numer. 163 (2003), 189--195 | ||
| 10. | æ�Žå¦è‰¯ï¼ŒR.Y. Liu，H.X. Zhao | |
| The roots of sigma-polynomials | ||
| Appl. Math. J. Chinese Univ. Ser. B 18 (2003), No.2, 230--23 | ||
| 11. | 金泽民，æ�Žå¦è‰¯ | |
| On a conjecture on k-walks of graphs | ||
| Australas. J. Combin. 29 (2004), 135--142 | ||
| 12. | æ�Žå¦è‰¯ï¼ŒL.G. Wang，S.G. Zhang | |
| Families of integral trees with diameters 4,6 and 8 | ||
| Discrete Applied Math. 136 (2004) No.2-3, 349--362 | ||
| 13. | æ�Žå¦è‰¯ï¼ŒR.Y. Liu，C.F. Ye，H.X. Zhao | |
| The chromaticity of complete multipartite graphs | ||
| Graphs Combin. 20 (2004) No.3, 423--434 | ||
| 14. | æ�Žå¦è‰¯ï¼ŒR.Y. Liu，L.G. Wang，H.X. Zhao | |
| On properties of adjoint polynomial of graphs and its applications | ||
| Australas. J. Combin. 30 (2004), 291--306 | ||
| 15. | æ�Žå¦è‰¯ï¼ŒR.Y. Liu，S.G. Zhang，H.X. Zhao | |
| On the minimum real roots of the sigma-polynomials and chromatic uniqueness of graphs | ||
| Discrete Math. 281 (2004), No.1-3, 277--294 | ||
| 16. | 陈永å·�，æ�Žå¦è‰¯ï¼Œéƒ‘æ´� | |
| Matrix method for linear sequential dynamical systems on digraphs | ||
| Appl. Math. Comput. 160 (2005), No.1, 197--212 | ||
| 17. | 陈永å·�，æ�Žå¦è‰¯ï¼ŒçŽ‹è¶…ï¼Œå¼ æ™“å²© | |
| The minimum all-ones problem for trees | ||
| SIAM J. Comput. 33 (2004), No.2, 379--392 | ||
| 18. | æ�Žå¦è‰¯ï¼Œæ�¨äº¦æŒº | |
| Sharp bounds for the general Randic index | ||
| MATCH Commun. Math. Comput. Chem. 51 (2004), 155--166 | ||
| 19. | æ�Žå¦è‰¯ï¼ŒH.X. Zhao | |
| Trees with small Randic connectivity indices | ||
| MATCH Commun. Math. Comput. Chem. 51 (2004), 167--178 | ||
| 20. | æ�Žå¦è‰¯ï¼ŒH.X. Zhao | |
| On the Fibonacci numbers of trees | ||
| Fibonacci Quart. 44 (1) (2006), 32--38 | ||
| 21. | æ�Žå¦è‰¯ï¼ŒH.X. Zhao | |
| Trees with the first three smallest and largest generalized toplogical indeices | ||
| MATCH Commun. Math. Comput. Chem. 50 (2004), 57--62 | ||
| 22. | æ�Žå¦è‰¯ï¼Œå¼ 晓岩 | |
| The edge split reconstruction problem for chemical trees is NP-complete | ||
| MATCH Commun. Math. Comput. Chem. 51 (2004), 205--210 | ||
| 23. | æ�Žå¦è‰¯ï¼ŒZ.M. Li，L.S. Wang | |
| The inverse problems for some topological indices in combinatorial chemistry | ||
| J. Comput. Biol. 10 (2003), No.1, 47--55 | ||
| 24. | æ�Žå¦è‰¯ï¼ŒL.S. Wang | |
| Solutions for two conjectures on the inverse problem of the Wiener index of peptoids | ||
| SIAM J. Discrete Math. 17 (2003), No.2, 210--218 | ||
| 25. | R.H. Li，æ�Žå¦è‰¯ | |
| Binary construction of quantum codes of minimum distance three and four | ||
| IEEE Trans. Inform. Theory 50 (2004), No.6, 1331--1336 | ||
| 26. | R.H. Li，æ�Žå¦è‰¯ | |
| Quantum codes constructed from binary cyclic codes | ||
| Int. J. Quantum Info. 2 (2004), No.2, 265--272 | ||
| 27. | 陈彩云，�治国，乔胜勇，文硕频 | |
| 基于决ç–æ ‘çš„ä¸�完全决ç–表的数æ�®è¡¥å……å�Šè§„则æ��å�– | ||
| 计算机应用 23 (2003), No.11, 17--19 | ||
| 28. | 陈彩云，�治国，乔胜勇，文硕频 | |
| A fast algorithm for building concept lattice | ||
| IEEE 1 (2003), No.2-5, 163--167 | ||
| 29. | 陈彩云，�治国，乔胜勇，文硕频 | |
| Study on discretization in rough set based on geneic algorithm | ||
| IEEE 3 (2003), No.2-5, 1430--1434 |
