2017年接��表论文36篇

1. N. Li,许译方,王超

Quasi-homography warps in image stitching

IEEE Trans. Multimedia
2. å­™æ…§ï¼Œå¼ æ˜Žæ™º

On the enumeration and congruences for m-ary partitions

J. Number Theory
3. é™ˆæ°¸å·�

The spt-Function of Andrews

Surveys in Combinatorics 2017, A. Claesson, M. Dukes, S. Kitaev, D. Manlove and K. Meeks, Eds., Cambridge Univ. Press, Cambridge, 2017
4. é™ˆæ°¸å·�,孙慧

Stanley's Lemma and multiple theta functions

SIAM J. Discrete Math.
5. éƒœç’�ç’�,解红å�¶ï¼Œæ�¨ç«‹æ³¢

The Smith normal form of a specialized Giambelli-type matrix

Adv. Appl. Math.
6. æ�¨ç«‹æ³¢ï¼Œå¼ å½ª

Brenti's open problem on the real-rootedness of q-Eulerian polynomials of type D

SIAM J. Discrete Math.
7. æ�Žå…‰ï¼Œè·¯åœ¨å¹³

On alternatively connected edge-transitive graphs of square-free order

Graphs Combin.
8. é›·è¾‰ï¼Œå�²æ°¸å ‚,Z-X. Song, T. Wang

Star 5-edge-colorings of subcubic multigraphs

Discrete Math.
9. é›·è¾‰ï¼Œå�²æ°¸å ‚, Z-X. Song

Star chromatic index of subcubic multigraphs

J. Graph Theory
10. å…°æ°¸æ–°ï¼ŒZ. Qin, å�²æ°¸å ‚

The Turan number of 2P7

Discuss. Math. Graph Theory
11. é›·è¾‰ï¼ŒH. Liu, C. Magnant, å�²æ°¸å ‚

Total rainbow connection of digraphs

Discrete Appl. Math.
12. æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œ C. Magnant,张婧å§�

Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs

Results Math.
13. é‚“ 波,æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œæ¯›äºšå¹³ï¼Œèµµæµ·å…´

Conflict-free connection numbers of line graphs

Proc. COCOA2017, Lecture Notes Computer Sci.
14. S.S. Li,å�²æ°¸å ‚,J.H. Tu

The generalized 3-connectivity of Cayley graphs generated by trees and cycles

Graphs Combin.
15. æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

An updated survey on rainbow connections of graphs-a dynamic survey

Theory & Applications of Graphs
16. é¡¾ 冉,æ�Žå­¦è‰¯ï¼Œè¦ƒå¿ ç¾Žï¼Œå�²æ°¸å ‚,æ�¨ 康

Non-jumping numbers for 5-uniform hypergraphs

Appl. Math. Comput.
17. é‚“波,æ�Žå­¦è‰¯ï¼ŒB. Shader,W. So

On the maximum skew spectral radius and minimum skew energy of tournaments

Linear Multilinear Algebra
18. D. Hu, æ�Žå­¦è‰¯, X.G. Liu, S.G. Zhang

The von Neumann entropy of random multipartite graphs

Discrete Appl. Math.
19. æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œå¼ å©§å§�

Nordhaus-Gaddum-type theorem for total proper connection number of graphs

Bull. Malays. Math. Sci. Soc.
20. Y.B. Ma,路在平

Rainbow connection numbers of Cayley digraphs on abelian groups

Appl. Math. Comput. 311 (2017) 178--183
21. é›·è¾‰ï¼ŒS. Li,H. Liu,å�²æ°¸å ‚

 Rainbow vertex connection of digraphs

J. Comb. Optim.
22. æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œå¼ å©§å§�

3-Rainbow index and forbidden subgraphs

Graphs Combin.
23. é»„飞,æ�Žå­¦è‰¯ï¼Œè¦ƒå¿ ç¾Žï¼ŒC. Magnant,K. Ozeki

On two conjectures about the proper connection number of graphs

Discrete Math.
24. æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œå¼ å©§å§�

The k-proper index of complete bipartite and complete multipartite graphs

Australas. J. Combin.
25. G.X. Wang,路在平

The two-arc-transitive graphs of square-free order admitting alternating or symmetric groups

J. Aust. Math. Soc.
26. é™ˆè™Žå�¶ï¼Œè·¯åœ¨å¹³

Edge-transitive homogeneous factorisations of complete uniform hypergraphs

J. Graph Theory
27. é™ˆè™Žå�¶ï¼Œè·¯åœ¨å¹³

Symmetric factorizations of the complete uniform hypergraph

J. Algebraic Combin.
28. é™ˆè™Žå�¶ï¼Œè·¯åœ¨å¹³

On vertex-transitive self-complementary digraphs

Ars Combin.
29. K. Das,å�²æ°¸å ‚

Some properties on entropies of graphs

MATCH Commun. Math. Comput. Chem.
30. é‚“ 波,æ�Žå­¦è‰¯

On L-borderenergetic graphs with maximum gegree at most 4

MATCH Commun. Math. Comput. Chem.
31. æ�Žæ–‡é�™ï¼Œæ�Žå­¦è‰¯ï¼Œå�´ 迪

Hardness result for the total rainbow k-connection of graphs

Appl. Math. Comput.
32. D. Hu,æ�Žå­¦è‰¯ï¼ŒX.G. Liu,S.G. Zhang

The spectral distribution of random mixed graphs

Linear Algebra Appl.
33. æŸ³è¶…

On the index r free sequences over finite cyclic groups

Int. J. Number Theory
34. S.Y. Tang,王春林

Rational-Transcendental dichotomy of power series with a restriction on coefficients

Monatsh. Math.
35. çŽ‹æ˜¥æž—ï¼Œèµµå‡¯æ–‡

On zero-sum subsequence of length not exceeding a given number

J. Number Theory
36. D.C. Han,张汉斌

On zero-sum subsequences of prescribed length

Int. J. Number Theory