2013年接��表论文40篇

1. å´”素平,谷ç�Šç�Š

Congruences for k dots bracelet partitions functions

Int. J. Number Theory
2. é™ˆæ°¸å·�,郭龙

Equivalence Classes of Full-Dimensional 0/1-Polytopes with Many Vertices

Discrete Comput. Geom.
3. é™ˆæ°¸å·�,å¤�先伟

Proof of a Conjecture of Hirschhorn and Sellers on Overpartitions

Acta Arith.
4. é™ˆæ°¸å·�,刘å®�,王å�¥

Linked Partitions and Permutation Tableaux

Electron. J. Combin. 20(3) (2013) #P53
5. é™ˆæ°¸å·�,郭剑峰,王星炜

Zeta Functions and the Log-behavior of Combinatorial Sequences

Proc. Edinb. Math. Soc. (2).
6. æ�Žé›ªç�Šï¼Œæ¢…彬,缪银凤

Eulerian pairs on Fibonacci words

Discrete Math.
7. é™ˆæ°¸å·�,郭剑峰,王星炜

Infinitely Log-monotonic Combinatorial Sequences

Adv. Appl. Math. 52 (2014) 99--120
8. è§£çº¢å�¶ï¼Œå¼ å½ª

Derivation of the Real-rootedness of Coordinator Polynomials from the Hermite-Biehler Theorem

Acta Math. Hungar.
9. é™ˆæ°¸å·�,代玉林,周大跑

Ordered Partitions Avoiding a Permutation Pattern of Length 3

European J. Combin. 36 (2014) 416--424
10. å´”素平,谷ç�Šç�Š

Arithmetic properties of l-regular partitions

Adv. in Appl. Math.
11. æ¨Šå¦‚冰,æ�¨ç‘žé¾™ï¼ŒäºŽå©·

On the maximum number of k-hooks of partitions of n

Electron. J. Combin. 20(2) (2013) #P49
12. é™ˆæ°¸å·�,彭芳芳

Disposition polynomials and plane trees

European J. Combin.
13. é�³æµ·æ¶›ï¼Œå­™æ…§

On Spieb' s conjecture on harmonic numbers

Discrete Appl. Math. 161 (2013) 2038--2041
14. é™ˆæ°¸å·�,彭芳芳,æ�¨ç‘žé¾™

Decomposition of triply rooted trees

Electron. J. Combin. 20(2) (2013) #P10
15. é™ˆæ°¸å·�,季é�’,é�³æµ·æ¶›ï¼Œæ²ˆä¸€é¢–

On the number of partitions with designated summands

J. Number Theory
16. é™ˆæ°¸å·�,代玉林,T. Dokos,T. Dwyer,B.E. Sagan

On 021-avoiding ascent sequences

Electron. J. Combin. 20(1) (2013) #P76
17. é™ˆæ°¸å·�,æ�œåº·ï¼Œä¾¯åº†è™Žï¼Œå­™æ…§

Congruences of multipartition functions modulo powers of primes

Ramanujan J.
18. éŸ©å�Žï¼Œè·¯åœ¨å¹³

A note on connected cubic cayley graphs

Discrete Math. 18 (2013) 1763--1766
19. éŸ©å�Žï¼Œè·¯åœ¨å¹³

A ne primitive groups and Semisymmetric graphs

Electron. J. Combin. 20(2) (2013) #P39
20. æ�Žå­¦è‰¯ï¼Œæ¯›äºšå¹³ï¼Œå­™è·ƒæ–¹

On the generalized (edge-)connectivity of graphs

Australas. J. Combin.
21. A. Anuradha,R. Balakrishnan,陈å°�林,æ�Žå­¦è‰¯ï¼Œè¿žä¼šä¹¦ï¼ŒWasin So

Skew spectra of oriented bipartite graphs

Electron. J. Combin.
22. é»„å°�龙,æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Note on the hardness of rainbow connections for planar and line graphs

Bull. Malays. Math. Sci. Soc.
23. é™ˆå°�林,æ�Žå­¦è‰¯ï¼Œè¿žä¼šä¹¦

4-Regular oriented graphs with optimum skew energy

Linear Algebra Appl.
24. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œåˆ˜è’™è’™

The (revised) Szeged index and the Wiener index of a nonbipartite graph

European J. Combin.
25. é©¬æ™¶ï¼Œå�²æ°¸å ‚,岳军

On the extremal Wiener polarity index of unicyclic graphs with a given diameter

Mathematical Chemistry Monographs No.16,2014
26. S.J. Ji,æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Extremal matching energy of bicyclic graphs

MATCH Commun. Math. Comput. Chem.
27. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œæ¯›äºšå¹³ï¼Œå­™è·ƒæ–¹

Note on the generalized connectivity

Ars Combin.
28. é¡¾å†‰ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

The generalized 3-connectivity of random graphs

Acta Math. Sin.
29. æ�Žå­¦è‰¯ï¼Œåˆ˜ç´ å¨Ÿ

Rainbow connection number and the number of blocks

Graphs Combin.
30. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œæ¯›äºšå¹³

On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

Bull. Malays. Math. Sci. Soc.
31. è”¡åº†ç�¼ï¼Œæ�Žå­¦è‰¯ï¼Œå®‹æ±Ÿç«‹

New skew Laplacian energy of simple digraphs

Trans. Combin.
32. è”¡åº†ç�¼ï¼Œæ�Žå­¦è‰¯ï¼Œå®‹æ±Ÿç«‹

Solutions to conjectures on the (k,l)-rainbow index of complete graphs

Networks
33. æ�Žå­¦è‰¯ï¼Œåˆ˜è’™è’™

Bicyclic graphs with maximal revised Szeged index

Discrete Appl. Math.
34. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œè¿žä¼šä¹¦

Further hardness results on the rainbow vertex-connection number of graphs

Theoret. Comput. Sci.
35. é™ˆå°�林,æ�Žå­¦è‰¯ï¼Œè¿žä¼šä¹¦

The skew energy of random oriented graphs

Linear Algebra Appl.
36. æ�ŽèŽŽèŽŽï¼Œæ�ŽçŽ®ï¼Œæ�Žå­¦è‰¯

The generalized connectivity of complete equipartition 3-partite graphs

Bull. Malays. Math. Sci. Soc.
37. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œåˆ˜è’™è’™ï¼ŒI. Gutman

On a relation between Szeged and wiener indices of bipartite graphs

Trans. Combin.
38. æ�Žå­¦è‰¯ï¼Œåˆ˜ç´ å¨Ÿ

 A sharp upper bound for the rainbow 2-connection number of a 2-connected graph

Discrete Math. 313 (2013) 755--759
39. èŒƒçމå�Œï¼Œé«˜ç»´ä¸œï¼ŒJ.T. Peng,王林林,钟庆海

 Remarks on tiny zero-sum sequences

Integers 13 (2013) #A52
40. é«˜ç»´ä¸œï¼ŒJ.T. Peng,钟庆海

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

Acta Arith. 158(3) (2013) 271--285