**Ars Combinatoria****Volume CXXXIII, July, 201**

**Li Wang**, “On the Semisymmetric Graphs of Order 2p^{3}: faithful and primitive case”, pp. 3-15**J.K. Sareen and M. Rana**, “Four-way combinatorial interpretations of some Rogers-Ramanujan type identities”, pp. 17-35**Yunshu Gao and Lingxiu Wu**, “The Extremal Function for Three Disjoint Theta Graphs”, pp. 37-49**G. Dror, A. Lev, Y. Roditty and R. Zigdon**, “On the rainbow connection number of graphs”, pp. 51-67**Dingjun Lou**, “A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs”, pp. 69-92**Dinesh G. Sarvate and Li Zhang**, “Decompositions of λK_{n}into LOE and OLE Graphs”, pp. 93-105**Elif Tan**, “On Bi-Periodic Fibonacci And Lucas Numbers by Matrix Method”, pp. 107-113**Bart De Bruyn**, “On some 2-tight sets of polar spaces”, pp. 115-131**Nader Jafari Rad, Akbar Jahanbani and Roslan Hasni**, “Pentacyclic Graphs with Maximal Estrada Index”, pp. 133-145**Wensheng Li, Huaming Xing and Zhongsheng Huang**, “Paired domination number of generalized Petersen graphs P(n,2)”, pp. 147-154**D.A. Mojdeh, B. Samadi and S.M. Hosseini Moghaddam**, “Limited packing vs tuple domination in graphs”, pp. 155-161**Li Xiuli and Tan Mingming**, “Skew-quasi-cyclic codes over Ml(F_{q})[X,θ]”, pp. 163-177**Meijin Luo and Xi Li**, “Upper bound on the primitive exponents of a class of three-colored digraphs”, pp. 179-195**Sezer Sorgun**, “An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue”, pp. 197-204**Xun-Tuan Su**, “The truncated determinants of combinatorial rectangular arrays”, pp. 205-216**Yiqiao Wang, Xiaoxue Hu and Weifan Wang**, “The chromatic number of the square of a Halin graph with maximum degree five is six”, pp. 217-231**Dafik, Slamin, Dushyant Tanna, Andrea Semanicova-Fenovcikova and Martin Baca**, “Constructions Of H-Antimagic Graphs Using Smaller Edge-Antimagic Graphs”, pp. 233-245**Rundan Xing**, “Note on the distance spectral gap of graphs”, pp. 247-258**Haicheng Ma, Wenhua Yang, Xiafei Meng and Shenggang Li**, “The characterization of graph by positive inertia index”, pp. 255-267**A.R. Moghaddamfar, S. Rahbariyan, S. Navid Salehy and S. Nima Salehy**, “The number of spanning trees of power graphs associated with specific groups and some applications “, pp. 269-296**Hsun Su, Yuan-Kang Shih, Shih-Yan Chen and Shin-Shin Kao**, “A study on degree characterization for hamiltonian-connected graphs”, pp. 297-316**Fuyuan Chen**, “A relationship between Minors and Linkages”, pp. 317-327**M.A. Seoud and M.A. Salim**, “Some results and remarks on harmonic mean and mean cordial labelings”, pp. 329-340**Zhen-Mu Hong, Xinmin Hou, Jiaao Li and Yang Yang**, “A note on broom number and maximum edge-cut of graphs”, pp. 341-347**Xin Zhang**, “List vertex arboricity of graphs without forbidden minors”, pp. 349-353**Yasemin Tasyurdu and Omur Deveci**, “The Fibonacci Polynomials in Rings”, pp. 355-366**Pengli Lu and Yang Yang**, “Generalized characteristic polynomial of generalized R-vertex corona”, pp. 367-376**Yantao Li, Huiwen Cheng and Qinghua Ma**, “A note on non-existence of cubic semisymmetric graphs of order 8p or 8p^{2}“, pp. 377-383**R. Lakshmi, G. Rajasekaran and R. Sampathkumar**, “On Lower Orientable Strong Diameter And Strong Radius Of Some Graphs”, pp. 385-400**Ling Xue**, “List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles”, pp. 401-406**Sheng-Liang Yang, Yan-Xue Xu and Xiao Gao**, “On the half of a Riordan array”, pp. 407-422