2009年接��表论文61篇

1. åˆ˜å�¥ï¼Œåˆ˜ä¹�强

Set systems with cross L-intersection and k-wise L-intersecting families

Discrete Math. 309 (2009), 5920-5925
2. ä¾¯åº†è™Žï¼ŒY.-P. Mu

Minimal universal denominators for linear difference equations

J. Difference Equ. Appl.
3. è°·ç�Šç�Šï¼ŒH. Prodinger,S. Wagner

Bijections for a class of labeled plane trees

European J. Combin.
4. G. N. Han,季é�’

Combining hook length formulas and BG-ranks for partitions via the Littlewood ___decomposition

Trans. Amer. Math. Soc.
5. é™ˆæ°¸å·�,韩æ€�伟,Christian Reidys

Random k-noncrossing RNA structures

Proc. Natl. Acad. Sci. USA 106 (52) (2009) 22061-22066
6. é™ˆå®¹ï¼Œå�‘å¼€å�—

A note on totally free matroids

Graphs Combin.
7. é™ˆæ°¸å·�,高永,何佳

Labeled partitions with colored permutations

Discrete Math. 309 (21) (2009) 6235-6244
8. ä»˜æ¢…,H. Pan,张帆

Symmetric identities on Bernoulli polynomials

J. Number Theory
9. å­£é�’

The combinatorics of k-marked Durfee symbols

Trans. Amer. Math. Soc.
10. é™ˆæ°¸å·�,å”�凌,赵飞燕

Derangement polynomials and excedances of type B

Electron. J. Combin. 16(2) (2009), #R15
11. é™ˆæ°¸å·�,高星强,郭龙

Hook length formulas for trees by Han's expansion

Electron. J. Combin.
12. é™ˆæ°¸å·�,顾春燕

The reverse ultra log-concavity of the Boros-Moll polynomials

Proc. Amer. Math. Soc.
13. é™ˆæ°¸å·�,刘ä¹�强,王星炜

Families of sets with intersecting clusters

SIAM J. Discrete Math. 23(3) (2009) 1249-1260
14. çŽ‹å½¬ï¼Œå�‘å¼€å�—

On k-tuple domination of random graphs

Appl. Math. Lett. 22 (2009) 1513-1517
15. ä»˜æ¢…,张帆

Inverse Relations and the Products of Bernoulli Polynomials

Graphs Combin.
16. ä»˜æ¢…,A. Lascoux

Non Symmetric Cauchy Kernels for the Classical Groups

J. Combin. Theory Ser. A 116 (2009) 903–917.
17. L. Shapiro,王å�¥

A bijection between 3-Motzkin paths and Schroder paths with no peak at odd height

J. Integer Sequences 12 (2009) Article 09.3.2.
18. è°·ç�Šç�Šï¼ŒH. Prodinger

Bijections for 2-plane trees and ternary trees

European J. Combin.
19. é«˜å°‰ï¼Œä¾¯åº†è™Žï¼Œè¾›å›½ç­–

On P-partitions related to ordinal sums of posets

European J. Combin. 30(5) (2009) 1370�1381
20. é™ˆæ°¸å·�,å”�凌,王星炜,æ�¨ç«‹æ³¢

The q-Log-convexity of the generating functions of the squares of binomial coefficients

Adv. Appl. Math. 44 (2010) 85-110.
21. é™ˆæ°¸å·�,秦晶,Christian Reidys,D. Zeilberger

Efficient counting and asymptotics of k-noncrossing tangled diagrams

Electron. J. Combin. 16 (2009) #R37
22. é™ˆæ°¸å·�,窦全æ�°ï¼Œå”�凌,æ�¨ç«‹æ³¢

The srank Conjecture on Schur's Q-Functions

Pacific J. Math. 244 (2) (2010) 211-234.
23. é™ˆæ°¸å·�,孙慧

Extended Zeilberger's algorithm for identities on Bernoulli and Euler polynomials

J. Number Theory 129 (2009) 2111--2132
24. é™ˆæ°¸å·�,高永,季é�’,æ�Žæ°¸ç¥¥

A unification of two refinements of Euler's partition theorem

Ramanujan J. 23 (1) (2010) 137-149
25. é™ˆæ°¸å·�,庞兴梅,曲晓英

On the combinatorics of the Boros-Moll polynomials

Ramanujan J. 21 (1) (2010) 41-51
26. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Randic index, diameter and average distance

MATCH Commun. Math. Comput. Chem.
27. æ�œæ–‡å­¦ï¼Œæ�Žå­¦è‰¯ï¼Œæ�Žä¸€é˜³

Various energies of random graphs

MATCH Commun. Math. Comput. Chem.
28. M. Kano,é²�红亮,于é�’æž—

Component factors with large components in graphs

Applied Math Letter.
29. å§šç¥¥å¦¹

Maximum energy trees with one maximum and one second maximum degree vertex

MATCH Commun. Math. Comput. Chem.
30. Yuqing Lin,é²�红亮,å�´äº‘建,于é�’æž—

On super-connectivity of (4,g)-cages with even girth Networks

Networks
31. é²�红亮,å�´äº‘建,于é�’林,Yuqing Lin

New improvements on connectivity of cages

Acta Math. Sinica
32. é²�红亮,于é�’æž—

Constructive proof of deficiency theorem of (g,f)-factor

Sci China Ser.A
33. é²�红亮,æ�¨æ—­ï¼ŒäºŽé�’æž—

A note on vertex-coloring edge-weighting of graphs

Front. Math. China, 4 (2009), 325-334.
34. æ�ŽèŽŽèŽŽï¼Œæ�Žå­¦è‰¯ï¼Œé©¬çº¢å¹³ï¼ŒI. Gutman

On triregular graphs whose energy exceeds the number of vertices

MATCH Commun. Math. Comput. Chem.
35. æ�Žé�–建,路在平,王改霞

A note on bi-normal Cayley Graphs

Ars Combin.
36. æ�Žé�–建,路在平

Cubic s-arc transitive Cayley graphs

Discrete Math. 309 (2009) 6014-6025
37. æ�Žå­¦è‰¯ï¼Œæ�Žä¸€é˜³ï¼Œå�²æ°¸å ‚

Note on the energy of regular graphs

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

Note on conjugated unicyclic graphs with minimal energy

MATCH Commun. Math. Comput. Chem.
39. Z. M. Jin,æ�Žå­¦è‰¯

Anti-Ramsey numbers for graphs with independent cycles

Electron. J. Combin. 16(1) (2009), #R85
40. æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

Rainbow connection numbers of line graphs

Ars Combin.
41. æ�Žå­¦è‰¯ï¼Œé©¬çº¢å¹³

All connected graphs with maximum degree at most 3 whose energies are equal to the number of vertices

MATCH Commun. Math. Comput. Chem.
42. æ�Žå­¦è‰¯ï¼Œé©¬çº¢å¹³

All hypoenergetic graphs with maximum degree at most 3

Linear Algebra Appl.
43. æ�Žå­¦è‰¯ï¼Œåˆ˜å»ºç†™

A proof of a conjecture on the Randic index of graphs with given girth

Discrete Appl. Math.
44. æ�Žå­¦è‰¯ï¼Œåˆ˜å»ºç†™

Complete solution to a conjecture on the Randic index of triangle-free graphs

Discrete Math.
45. æ�Žå­¦è‰¯ï¼Œé©¬çº¢å¹³

Hypoenergetic and strongly hypoenergetic k-cyclic graphs

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

Note on bipartite unicyclic graphs of a given bipartition with minimal energy

MATCH Commun. Math. Comput. Chem.
47. æ�Žå­¦è‰¯ï¼Œå¾�志霞

Rainbow number of matchings in regular bipartite graphs

Applied Math. Letter
48. æ�Žå­¦è‰¯ï¼ŒB. Liu,刘建熙

Complete solution to a conjecture on Randic index

Eur. J. Oper. Res.
49. æ�Žå­¦è‰¯ï¼Œç½—æ�¨

Weighted Lee algorithm on rectilinear Steiner tree with obstacles and boundary

Proceedings of CSIE'09, IEEE Computer Society
50. æ�œæ–‡å­¦ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Algorithms and extremal problem on Wiener polarity index

MATCH Commun. Math. Comput. Chem. 62(1) (2009)
51. M. Freeze,高维东,A. Geroldinger

The critical number of finite abelian groups

J. Number Theory
52. é«˜ç»´ä¸œï¼Œå½­æ±Ÿæ¶›

On the number of zero-sum subsequences of restricted size

Integers
53. é«˜ç»´ä¸œï¼ŒA. Geroldinger,D. J. Grynkiewicz

Inverse zero-sum problems III

Acta Arith.
54. é«˜ç»´ä¸œï¼ŒY.L. Li

The Erdos-Ginzburg-Ziv Theorem for finite solvable groups

J. Pure Appl. Algebra
55. é»„文达,秦晶,Christian Reidys,P. Stadler

Target prediction and a statistical sampling algorithm for RNA-RNA interaction

Bioinformatics
56. é»„文达,秦晶,Christian Reidys,P. Stadler

RNA-RNA Interaction Predition_ Partition function and base pair pairing probabilities

Bioinformatics
57. é�³å®‡ï¼ŒChristian Reidys

RNA pseudoknot structures with arc-length ≥ 3 and stack-length ≥ σ

Discrete Appl. Math.
58. é�³å®‡ï¼ŒChristian Reidys

Irreducibility in RNA structures

Bull. Math. Bio.
59. é»„文达,彭文军,Christian Reidys

Folding 3-noncrossing RNA pseudoknot structures

J. Comp. Biol.
60. é�³å®‡ï¼ŒChristian Reidys

On the decomposition of k-noncrossing RNA structures

Adv. Appl. Math.
61. éŸ©æ€�伟,Christian Reidys

Stacks in Canonical RNA pseudoknot structures

Math. Biosci.