2004年接��表论文57篇

1. å­™æ€¡ä¸œ

The statistic_number of udu's_in Dyck paths

Discrete Math. 287 (2004), No.1-3, 177--186
2. å­™æ€¡ä¸œ

Numerical triangles and several classical sequences

Fibonacci Quart. 43 (4) (2005), 359--370
3. æ—¶ä¿­ç›Š

Congruence classes of presentations for the complex reflection groups G(m,p,n)

J. Algebra 284(1) (2005), 392--414
4. æ—¶ä¿­ç›Š

Fully commutative elements in the Weyl and affine Weyl groups

J. Algebra 284(1) (2005), 13--36
5. æ—¶ä¿­ç›Š

Fully commutative elements and Kazhdan-Lusztig cells in the finite and affine Coxeter groups,II

Proc. Amer. Math. Soc. 133 (2005), 2525--2531
6. æ—¶ä¿­ç›Š

Fully commutative elements and Kazhdan-Lusztig cells in the finite and affine Coxeter groups

Proc. Amer. Math. Soc. 131 (2003), No.11, 3371--3378 (electronic)
7. æ—¶ä¿­ç›Š

Yang-Baxter bases for Coxeter groups

J. London Math. Soc. (2) 69 (2004), 349--362
8. èƒ¡ 毅

Topological aspects of Chow quotients

J. Differential Geom., to appear.
9. R. Höfer,W.L. Huang,万哲先

Adjacency preserving mappings of symmetric and hermitian (1)

Aequationes Math. 67 (2004), No.1-2, 132--139
10. Z.M. Tang,万哲先

Symplectic graphs and their automorphisms

European J. Combin. 27 (1) (2006), 38--50
11. éƒ­å†›ä¼Ÿï¼Œæ›¾æ±Ÿ

A note on two identities arising from enumeration of convex polyominoes

J. Comput. Appl. Math. 180 (2) (2005), 413--423
12. æ›¾æ±Ÿ

On some q-identities related to divisor functions

Adv. in Appl. Math. 34 (2) (2005), 313--315
13. æ›¾æ±Ÿï¼Œå‘¨ç‘¾

A $Q$-analog of the Seidel generation of Genocchi numbers

European J. Combin., to appear.
14. æ›¾æ±Ÿï¼Œå‘¨ç‘¾

Applications of Waring's formula to some identities of Chebyshev polynomials

Fibonacci Quart., to appear.
15. ä¾¯æ±Ÿéœžï¼Œæ›¾æ±Ÿ

Two new families of q-positive integers

Ramanujan J., to appear.
16. ä»˜ 梅,Alain Lascoux

Partition analysis and symmetrizing operators

J. Combin. Theory Ser. A 109 (2) (2005), 339--343
17. ä¾¯åº†è™Žï¼ŒAlain Lascoux,穆彦平

Continued fractions for Rogers-Szego polynomials

Numer. Algorithms 35 (2004), No.1, 81--90
18. ä¾¯åº†è™Žï¼ŒAlain Lascoux,穆彦平

Evaluation of some Hankel determinants

Adv. in Appl. Math. 34 (2005), 845--852
19. é™ˆæ°¸å·�,严慧芳,æ�¨ä¸½æ•�

Identities from weighted Motzkin paths

Adv. in Appl. Math. 41 (2008), 329–334
20. é™ˆæ°¸å·�,阎国光,æ�¨ç«‹æ³¢

Transformations of border strips and Schur function determinants

J. Algebraic Combin. 21 (2005), No.4, 379--394
21. é™ˆæ°¸å·�,C. Krattenthaler,æ�¨ç«‹æ³¢

The flagged Cauchy determinant

Graphs Combin. 21 (2005), 51--62
22. é™ˆæ°¸å·�,邓玉平,æ�œè‹¥éœž

Reduction of m-regular noncrossing partitions

European J. Combin. 26 (2) (2005), 237--243
23. é™ˆæ°¸å·�,D.C. Torney

Equivalence classes of matchings and lattice-square designs

Discrete Appl. Math. 145 (3) (2005), 349--357
24. é™ˆæ°¸å·�,侯庆虎,穆彦平

Applicability of the q-analogue of Zeilberger's algorithm

J. Symbolic Comput. 39 (2005), No.2, 155--170
25. é™ˆæ°¸å·�,L.W. Shapiro,æ�¨ä¸½æ•�

Parity reversing involutions on plane trees and 2-motzkin paths

European J. Combin. 27 (2) (2006), 283--289
26. é™ˆæ°¸å·�,付梅

Semi-finite forms of bilateral basic hypergeometric series

Proc. Amer. Math. Soc., to appear.
27. é™ˆæ°¸å·�,E. Deutsch,S. Elizalde

Old and young leaves on plane trees

European J. Combin., to appear, arXiv: math.CO/0410127
28. C.L. Barrett,陈永å·�,郑æ´�

Discrete dynamical systems on graphs and boolean functions

Math. Comput. Simulation 66 (2004), No.6, 487--497
29. æ�Žå­¦è‰¯ï¼Œéƒ‘æ´�

A unified approach to the extremal trees for different indices

MATCH Commun. Math. Comput. Chem. 54 (2005), No.1, 195--208
30. æ�Žå­¦è‰¯ï¼ŒX.Q. Wang,B. Wei

On the lower and upper bounds for general Randic index of chemical (n,m)-graphs

MATCH Commun. Math. Comput. Chem. 52 (2004), 157--166
31. èƒ¡çŽ‰æ¢…ï¼Œæ�Žå­¦è‰¯ï¼Œè¢�å…ƒ

Solutions to two unsolved questions on the best upper bound for the Randic index $R_{-1}$ of trees

MATCH Commun. Math. Comput. Chem. 54 (2005), 441--454
32. èƒ¡çŽ‰æ¢…ï¼Œæ�Žå­¦è‰¯ï¼Œè¢�å…ƒ

Trees with maximum general Randic index

MATCH Commun. Math. Comput. Chem. 52 (2004), 129--146
33. èƒ¡çŽ‰æ¢…ï¼Œæ�Žå­¦è‰¯ï¼Œè¢�å…ƒ

Trees with minimum general Randic index

MATCH Commun. Math. Comput. Chem. 52 (2004), 119--128
34. æ�Žå­¦è‰¯ï¼Œæ�¨äº¦æŒº

Best lower and upper bounds for the Randic index R_{-1} of chemical trees

MATCH Commun. Math. Comput. Chem. 52 (2004), 147--156
35. é™ˆæ°¸å·�,æ�Žå­¦è‰¯ï¼ŒçŽ‹è¶…ï¼Œå¼ æ™“å²©

Linear time algorithms to the minimum all-ones problem for unicyclic and bicyclic graphs

Electron. Notes Discrete Math. 17 (2004), 93--98
36. é‡‘应烈,C.L. Liu

Enumeration for spanning forests of complete bipartite graphs

Ars Combin. 70 (2004), 135--138
37. L. Sun,éƒ�星星

Positively curved cubic plane graphs are finite

J. Graph Theory 47 (2004), No.4, 241--274
38. G.T. Chen,G.H. Fan,éƒ�星星

Cycles in 4-connected planar graphs

European J. Combin. 25 (2004), No.6, 763--780
39. G.T. Chen,J. Xu,éƒ�星星

Circumference of graphs with bounded degree

J. Graph Theory 48 (4) (2005), 247--266
40. éƒ�星星

Infinite paths in planar graphs II, structures and ladder nets

MATCH Commun. Math. Comput. Chem. 54 (2005), No.1, 195--208
41. éƒ�星星

Infinite paths in planar graphs I, graphs with radial nets

J. Graph Theory 47 (2004), No.2, 147--162
42. P. Wang,于é�’æž—

A note on the degree monotonicity of (n;k)-cage

Bull. Inst. Combin. Appl., to appear.
43. D.J. Lou,于é�’æž—

Connectivity of k-extendable graphs with large k

Discrete Appl. Math. 136 (2004), No.1, 55--61
44. D.J. Lou,于é�’æž—

Sufficient conditions for n-matchable graphs

Australas. J. Combin. 29 (2004), 127--133
45. C. Hoede,æ�Žå­¦è‰¯ï¼ŒL.G. Wang

Two classes of integral regular graphs

Ars Combin. 76 (2005), 303--319
46. C. Hoede,æ�Žå­¦è‰¯ï¼ŒL.G. Wang

Integral complete r-partite graphs

Discrete Math. 283 (2004), No.1-3, 231--241
47. H.J. Broersma,æ�Žå­¦è‰¯ï¼ŒG. Woeginger,S.G. Zhang

Paths and cycles in colored graphs

Australas. J. Combin. 31 (2005), 299--312
48. æ�Žå­¦è‰¯ï¼ŒJ.C. Wu

Removable edges in longest cycles of 4-connected graphs

Graphs Combin. 20 (2004), No.3, 413--422
49. æ�Žå­¦è‰¯ï¼ŒL.S. Wang,J.C. Wu

Removable edges in a cycle of a 4-connected graph

Discrete Math. 287 (2004), No.1-3, 103--111
50. H.J. Broersma,M.C. Li,æ�Žå­¦è‰¯ï¼ŒL.M. Xiong

The Hamiltonian index of a graph and its branch-bonds

Discrete Math. 285 (2004), No.1-3, 279--288
51. æ�Žå­¦è‰¯ï¼ŒB. Zhao

Isomorphisms of $P_k$-graphs for $k\geq 4$

Discrete Math. 289 (2004), 71--80
52. æ�Žå­¦è‰¯ï¼ŒJ.J. Su,J.C. Wu

The number of removable edges in a 4-connected graph

J. Combin. Theory Ser. B 92 (2004), No.1, 13--40
53. é™ˆå½©äº‘,æ�Žæ²»å›½

关于属性约简和集�覆盖问题的讨论

计算机工程与应用 (2004), No.2, 44--46
54. å�´æ ‹ï¼Œæ»•育平

中文信�检索引擎中的分�与检索技术

计算机应用 24 (2004), No.7, 128--131
55. æ�Žå³°ä¼Ÿï¼Œæ�Žå­¦è‰¯

On the integrity of graphs

Proc. PDCS'2004, MIT, Cambridge, USA, 577--582
56. æ�Žå³°ä¼Ÿï¼Œæ�Žå­¦è‰¯

Computing the rapture degrees of graphs

IEEE Computer Society, Proc. ISPAN'2004, Hong Kong, 368--373
57. é‡‘泽民,æ�Žå­¦è‰¯

The complexity for partitioning graphs by monochromatic trees, cycles and paths

Int. J. Comput. Math. 81 (2004), No.11, 1357--1362