2007年接��表论文64篇

1. é™ˆæ°¸å·�, P. Paule, H. L. Saad

Converging to Gosper's algorithm

Adv. Appl. Math. 41 (2008), 351–364
2. é™ˆæ°¸å·�, æ�¨ä¸½æ•�

On Postnikov's hook length formula for binary trees

Europ. J. Combin. 29 (2008) 1563–1565
3. é™ˆæ°¸å·�, Andreas W.M. Dress, 俞强

Checking the reliability of a linear-programming based approach towards detecting ___community structures in networks

Systems Biol. 5 (2007) 286–291.
4. é™ˆæ°¸å·�, Andreas W.M. Dress, 俞强

Community structures of networks

Math. Comput. Sci. 1 (2008) 441-457
5. é™ˆæ°¸å·�, 张程艳

The skew and relative derangements of type B

Electron. J. Combin. 14 (2007) #N24
6. é™ˆæ°¸å·�, I. M. Gessel, 颜å�Žè�²ï¼Œ æ�¨ç«‹æ³¢

A major index for matchings and set partitions

J. Combin. Theory, Ser. A 115 (6) (2008) 1069-1076.
7. é™ˆå°�峰, L. W. Shapiro

On sequences G_n satisfying G_n = (d+2)G_(n-1) - G_(n-2)

J. Integer Seq. 10 (2007), Article 07.8.1
8. è¾›å›½ç­–

Constructing all magic squares of order three

Discrete Math.
9. W.C. Chu,付梅

Dougall-Dixon formula and harmonic number identities

Ramanujan J.
10. éŸ©å›½ç‰›

Euler-Mahonian triple set-valued statistics on permutations

European J. Combin., 29, 2008, 568-580.
11. D. Foata,韩国牛

Fix-Mahonian calculus III;a quadruple distribution

Monatsh. Math., 154, 2008, 177-197.
12. ä»˜æ¢…

A combinatorial proof of the Lebesgue identity

Discrete Math.
13. é™ˆæ°¸å·�,邓玉平,æ�¨ä¸½æ•�

Riordan paths and derangements

Discrete Math. 308 (11) (2008) 2222-2227
14. ä¾¯åº†è™Žï¼ŒToufik Mansour

Kernel method and linear recurrence system

J. Comput. Appl. Math. 216 (2008) 227--242.
15. é™ˆæ°¸å·�,H.L. Saad,孙慧

The bivariate Rogers-Szegö polynomials

J. Phys. A: Math. Theor. 40 (2007), 6071--6084
16. å­£é�’,H.S. Wilf

Extreme palindromes

Amer. Math. Monthly
17. B. Drake,I.M. Gessel,辛国策

Three proofs and a generalization of the Goulden-Litsyn-Shevelev conjecture on a sequence ___arising in algebraic geometry

J. Integer Seq. 10 (2007), Article 07.3.7
18. è¾›å›½ç­–

Generalization of Stanley's monster reciprocity theorem

J. Combin. Theory Ser. A
19. è°·ç�Šç�Šï¼Œæ�Žå²©ï¼ŒToufik Mansour

2-binary trees_bijections and related issues

Discrete Math.
20. é™ˆæ°¸å·�,æ�Žå²©ï¼ŒL.W. Shapiro

The butterfly decomposition of plane trees

Discrete Appl. Math. 155 (17) (2007) 2187–2201
21. é™ˆæ°¸å·�,侯庆虎,穆彦平

Nonterminating basic hypergeometric series and the q-Zeilberger algorithm

Proc. Edinb. Math. Soc. 51(3) (2008) 609--633.
22. æ�Žå²©ï¼ŒToufik Mansour

An identity involving Narayana numbers

European J. Combin.
23. é™ˆæ°¸å·�,å�´å®œå�‡ï¼Œé¢œå�Žè�²

Linked partitions and linked cycles

European J. Combin. 29 (2008) 1408-1426.
24. R.A. Sulanke,辛国策

Hankel determinants for some common lattice paths

Adv. in Appl. Math.
25. è·¯åœ¨å¹³

Primitive half-transitive graphs constructed from the symmetric groups of prime degrees

J. Combin. Theory Ser. B 97 (5) (2007) 818�826
26. M. Bilinski,Y. Kwo,éƒ�星星

On the reconstruction of planar graphs

J. Combin. Theory Ser. B 97 (2007)
27. Z.M. Jin,éƒ�星星,X. Zhang

Contractible subgraphs in k-connected graphs

J. Graph Theory 55 (2007) 121--136
28. Y.H. Ma, 于é�’æž—

Isolated toughness and existence of [a;b]-factors in graphs

J. Combin. Math. Combin. Comput. 62 (2007), 147-157.
29. é²�红亮, å�´äº‘建, 于é�’æž—, Y.Q. Lin

On superconnectivity of (4;g)-cages

LNCS, Proceeding of AWOCA07
30. æ®µè‹±å�Ž, H. Wu, 于é�’æž—

On chromatic and flow polynomial unique graphs

Discrete Appl. Math.
31. çŽ‹æ¶›, 于é�’æž—

Factor-critical property in 3-dominating-critical graphs

Discrete Math.
32. é™ˆå’Œï¼Œæ�Žå­¦è‰¯

Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs

Electron. J. Combin. 14 (2007), #R77
33. Z.M. Jin, æ�Žå­¦è‰¯

Graphs with the second largest number of maximal independent sets

Discrete Math.
34. æ�Žå­¦è‰¯ï¼Œåˆ˜è‰³ï¼ŒB. Zhao

Isomorphisms of directed P_3 - graphs

Ars Combin.
35. æ�Žå­¦è‰¯ï¼ŒC. Wang,X.Y. Zhang

The general sigma all-ones problem for trees

Discrete Appl. Math.
36. é™ˆå’Œï¼Œé‡‘泽民,æ�Žå­¦è‰¯ï¼Œæ¶‚建å�Ž

Heterochromatic tree partition numbers for complete bipartite graphs

Discrete Math.
37. Hajo Broersma, æ�Žå­¦è‰¯

On the complexity of dominating set problems related to the minimum all-ones problem

Theoret. Comput. Sci. 385 (2007) 60�70
38. æ�Žå­¦è‰¯ï¼Œå¼ å»ºæ–Œ

On bicyclic graphs with maximal energy

Linear Algebra Appl. 427 (2007) 87�98
39. æ�Žå­¦è‰¯ï¼Œåˆ˜è‰³

Path graphs versus line graphs----a survey

Chinese J. Engrg. Math.
40. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Corrections of proofs for Hansen and Mélot's two theorems

Discrete Appl. Math. 155 (2007) 2365�2370
41. L. Pavlovic,M. Stojanovic,æ�Žå­¦è‰¯

More on the best upper bound for the Randic index R-1 of trees

MATCH Commun. Math. Comput. Chem.
42. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

A survey on the Randic index

MATCH Commun. Math. Comput. Chem.
43. æ�Žå­¦è‰¯ï¼Œå¼ æ™“岩

On the minimum monochromatic or multicolored subgraph partition problems

Theoret. Comput. Sci. 385 (2007) 1–10
44. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚,钟玲平

Minimum general Randic index on chemical trees with given order and number of pendent ___vertices

MATCH Commun. Math. Comput. Chem.
45. H. Zhao,æ�Žå­¦è‰¯ï¼ŒR. Liu

Chromaticity of the complements of some sparse graphs

Australas. J. Combin. 37 (2007) 11--20
46. æ�Žå­¦è‰¯ï¼Œæ¶‚建å�Ž

NP-completeness of 4-incidence colorability of semi-cubic graphs

Discrete Math.
47. å�´äº‘建,于é�’æž—

Uniform star-factors of graphs with girth three

Australas. J. Combin.
48. æ�Žå³°ä¼Ÿï¼Œæ�Žå­¦è‰¯

The neighbor-scattering number can be computed in polynomial time for interval graphs

Comp. Math. Appl. 54 (2007) 679�686
49. G.-Z. Liu,于é�’林,L.-J. Zhang

Maximum fractional factors in graphs

Appl. Math. Lett. 20 (2007) 1237�1243
50. L.-G. Wang,H. Broersma,C. Hoede,æ�Žå­¦è‰¯ï¼ŒG. Still

Integral trees of diameter 6

Discrete Appl. Math. 155 (2007) 1254�1266
51. æ�Žå­¦è‰¯ï¼Œå¼ æ™“岩

三�新�形的全一问题

数学物�学报
52. é«˜ç»´ä¸œï¼Œ A. Geroldinger

On products of k atoms

Monatsh. Math.
53. G.Q. Wang,高维东

Davenport constant for semigroups

Semigroup Forum
54. é«˜ç»´ä¸œï¼ŒA. Geroldinger

Group algebras of finite abelian groups and their applications to combinatorial problems

Rocky Mountain J. Math.
55. é«˜ç»´ä¸œï¼ŒY.-L. Li

Remarks on group rings and the Davenport constant

Ars Combin.
56. é«˜ç»´ä¸œï¼ŒR. Thangadurai,J. Zhuang

Addition theorems on the cyclic groups of order $p^l$

Discrete Math.
57. é«˜ç»´ä¸œï¼Œè·¯åœ¨å¹³

The Erdös-Ginzburg-Ziv Theorem for dihedral groups

J. Pure Appl. Algebra 212 (2008) 311–319
58. é«˜ç»´ä¸œï¼Œä¾¯åº†è™Žï¼ŒW. Schmid, R. Thangadurai

On short zero-sum subsequences II

Integers 7 (2007) #A21
59. å­™èг

On subsequence sums of a zero-sum free sequence

Electron. J. Combin.
60. é«˜ç»´ä¸œï¼ŒA. Geroldinger,W.A. Schmid

Inverse zero-sum problems

Acta Arith. 128.3 (2007)
61. é�³å®‡ï¼ŒChristian Reidys

Central and local limit theorems for RNA structures

J. Theoret. Biol.
62. é�³å®‡ï¼Œç§¦æ™¶ï¼ŒChristian Reidys

Neutral networks of sequence to shape maps

J. Theoret. Biol.
63. é�³å®‡ï¼ŒChristian Reidys

Asymptotic enumeration of RNA structures with pseudoknots

Bull. Math. Biol.
64. é�³å®‡ï¼Œç§¦æ™¶ï¼ŒChristian Reidys

Combinatorics of RNA structures with pseudoknots

Bull. Math. Biol.