2011年接��表论文42篇

1. é™ˆæ°¸å·�,庞兴梅,曲晓英

Partially 2-colored permutations and the Boros-Moll polynomials

Ramanujan J.
2. é™ˆæ°¸å·�,æ�œåº·ï¼Œæ¢…彬

Combinatorial telescoping for an identity of Andrews on parity in partitions

European J. Combin. 33 (2012) 510-518
3. é™ˆæ°¸å·�,范久瑜,赵飞燕

Partitions and partial matchings avoiding neighbor patterns

European J. Combin. 33 (2012) 491-504
4. è°·ç�Šç�Šï¼ŒH. Prodinger

On some continued fraction expansions of the Rogers-Ramanujan type

Ramanujan J.
5. é™ˆæ°¸å·�,侯庆虎,é�³æµ·æ¶›

The Abel-Zeilberger algorithm

Electron. J. Combin. 18(2) (2011), #P17
6. é™ˆæ°¸å·�,高星强,郭龙

On Han's hook length formulas for trees

Electron. J. Combin. 18 (2011) #P155
7. é™ˆæ°¸å·�,范久瑜,贾岩涛

Labeled ballot paths and the Springer numbers

SIAM J. Discrete Math. 25 (2011) 1530-1546
8. é™ˆæ°¸å·�,侯庆虎,穆彦平

The extended Zeilberger algorithm with parameters

J. Symbolic Comput. 47(6) (2012) 643–654
9. é™ˆæ°¸å·�,王也洲,赵飞燕

Identities derived from noncrossing partitions of type B

Electron. J. Combin. 18 (2011) #P129
10. é™ˆæ°¸å·�,郭龙

Oscillating rim hook tableaux and colored matchings

Adv. in Appl. Math. 48 (2012) 393-406
11. é™ˆæ°¸å·�,顾春燕,马å�›ï¼ŒçŽ‹æ˜Ÿç‚œ

Higher order log-concavity in Euler's difference table

Discrete Math. 311 (20) (2011) 2128-2134
12. é™ˆæ°¸å·�,刘å®�

Permutation tableaux and the dashed permutation pattern 32–1

Electron. J. Combin. 18 (2011) #P111
13. é™ˆæ°¸å·�,顾春燕,马å�›

Minimal permutations and 2-regular skew tableaux

Adv. Appl. Math. 47 (4) (2011) 795-812
14. é™ˆæ°¸å·�,王星炜,å¤�先伟

The interlacing log-concavity of the Boros-Moll polynomials

Pacific J. Math. 254(1) (2011) 89-99
15. é™ˆç„•林,付梅

A 2n-point interpolation formula with its applications to q-identities

Discrete Math.
16. é™ˆæ°¸å·�,林丽å�Œ

Arithmetic properties of overpartition pairs

Acta Arith. 151(3) (2012) 263-277
17. é™ˆæ°¸å·�,范久瑜,贾岩涛

The generating function for the Dirichlet series Lm(s)

Math. Comput. 81(278) (2012) 1005-1023
18. Q.D. Kang,刘ä¹�强,王星炜

Restricted t-wise L-intersecting families on set systems

European J. Combin.
19. è®¡çœ�进,æ�Žé�™

An approach to the problem of the maximal energy of bicyclic graphs

MATCH Commun. Math. Comput. Chem.
20. é‚“兴超,K.N. Xiang,B. Wu

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs

Appl. Math. Lett.
21. è‘£ä¹�英,æ�Žå­¦è‰¯

Upper bound involving parameter sigma_2 for the rainbow connection number

Acta Math. Appl. Sin.
22. æ�ŽèŽŽèŽŽï¼Œè¿žä¼šä¹¦

Comment on “A proof for a conjecture on the Randic index of graphs with diameter�

Appl. Math. Lett.
23. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œåˆ˜ç´ å¨Ÿ

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups

Comput. Math. Appl.
24. æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

On the strong rainbow connection of a graph

Bull. Malays. Math. Sci. Soc.
25. æ�Žé�™ï¼Œæ�Žå­¦è‰¯

On the maximal energy trees with one maximum and one second maximum degree vertex

MATCH Commun. Math. Comput. Chem.
26. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œåˆ˜è’™è’™

Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph

Util. Math.
27. æ�ŽèŽŽèŽŽï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

The minimal size of a graph with generalized connectivity kappa_3 = 2

Australasian J. Combin.
28. æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

Rainbow connection numbers of complementary graphs

Util. Math.
29. æ�ŽèŽŽèŽŽã€�æ�Žå­¦è‰¯

Note on the hardness of generalized connectivity

J. Comb. Optim.
30. æ�ŽèŽŽèŽŽã€�æ�ŽçŽ®ã€�æ�Žå­¦è‰¯

The generalized connectivity of complete bipartite graphs

Ars Combin.
31. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

The complexity of determining the rainbow vertex-connection of a graph

Theoret. Comput. Sci.
32. æ�Žé�™ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

On the maximal energy tree with two maximum degree vertices

Linear Algebra Appl.
33. æ�Žå­¦è‰¯ï¼Œæ�Žä¸€é˜³

The asymptotic behavior of the Estrada index for trees

Bull. Malays. Math. Sci. Soc.
34. é™ˆå°�林,æ�Žå­¦è‰¯

A solution to a conjecture on two rainbow connection numbers of a graph

Ars Combin.
35. ç�«å�šä¸°ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Complete solution to a conjecture on the maximal energy of unicyclic graphs

European J. Combin.
36. ç�«å�šä¸°ï¼Œè®¡çœ�进,æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Solution to a conjecture on the maximal energy of bipartite bicyclic graphs

Linear Algebra Appl.
37. æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

Upper bounds for the rainbow connection numbers of line graphs

Graphs Combin.]
38. G.J. Chang,S.H. Chen,瞿勇科,G.Q. Wang,H.Y. Zhang

On the number of subsequences with a given sum in a finite abelian group

lectron. J. Combin. 18 (2011) #P133
39. éƒ­æ—¦ï¼Œçž¿å‹‡ç§‘,G.Q. Wang,Q.H. Wang

Extremal incomplete sets in finite abelian groups

Ars Combin.
40. èŒƒçމå�Œï¼Œé«˜ç»´ä¸œï¼Œé’Ÿåº†æµ·

On the Erd\"{o}s-Ginzburg-Ziv constant of finite abelian groups of high rank

J. Number Theory
41. é«˜ç»´ä¸œï¼ŒA. Geroldinger,王庆红

A quantitative aspect of non-unique factorizations the Narkiewicz constants.

Int. J. Number Theory
42. æ�Žæƒ³ï¼ŒM. Marz,秦晶,Christian Reidys

RNA-RNA interaction prediction based on multiple sequence alignments.

Bioinformatics