**Ars Combinatoria****Volume CXXVIII, July, 2016**

**Marius Tarnauceanu**, “On the factorization numbers of some finite p-groups”, pp. 3-9**Ahmet Tekcan, Arzu Ozkoc and Meltem E. Erasik**, “Some Algebraic Relations On Integer Sequences Involving Oblong And Balancing Numbers”, pp. 11-31**Sapna Jain**, “Error location technique in RT-spaces”, pp. 33-46**Jinyun Qi, Baohuan Zhang and Zengti Li**, “Lattices associated with Hamming graphs”, pp. 47-53**A. Aflaki, S. Akbari, D.S. Eskandani, M. Jamaali and H. Ravanbod**, “On The Harmonious Colouring of Trees”, pp. 55-62**Imed Boudabbous**, “Tournaments whose indecomposability graph admits a vertex cover of size 2”, pp. 63-82**Yaping Mao and Chengfu Ye**, “The fifth coefficient of adjoint polynomial and a new invariant”, pp. 83-102**Andrew Crites, Greta Panova and Gregory S. Warrington**, “Shape and pattern containment of separable permutations”, pp. 103-116**Zhongxun Zhu**, “On the Hosoya index and the Merrifield-Simmons index of bicyclic graphs with given matching number”, pp. 117-126**Shuya Chiba and Masao Tsugaki**, “A characterization of the graphs with high degree sum that are not covered by three cycles”, pp. 127-163**Csilla Bujtas, E. Sampathkumar, Zsolt Tuza, Charles Dominic and L. Pushpalatha**, “When the vertex coloring of a graph is an edge coloring of its line graph – a rare coincidence”, pp. 165-173**Miao Liang, Sufang Jiang and Beiliang Du**, “A new class of 2-fold perfect 4-splitting authentication codes”, pp. 175-189**P. Bhanumathy and S. Ramachandran**, “Reconstruction Number Of Separable Self Complementary Graphs And Others”, pp. 191-197**Anuradha Sharma and Suman Bala**, “On the weight distributions of some q-ary cyclic codes”, pp. 199-208**Jamel Dammak**, “On the {4, -k}-hypomorphy for digraphs”, pp. 209-224**Guang-Yi Sun, Zhen-Bin Gao and Sin-Min Lee**, “On full friendly index sets of twisted product of Mobius ladders”, pp. 225-239**Antonio Breda D’Azevedo, Domenico A. Catalano and Jan Karabas**, “Two infinite families of Archimedean maps of higher genera”, pp. 241-254**Hideki Goya**, “Turan-type problem for a cycle of length 6 in bipartite Eulerian digraph”, pp. 255-262**Feng Wang, Xiaohua Liu and Hongxia Sun**, “Relationships between distance two labellings and circular distance two labellings by group path covering”, pp. 263-277**Y.M. Borse**, “A Note On n-Connected Splitting-Off Matroids”, pp. 279-286**Yilun Shang**, “Bounds of distance Estrada index of graphs”, pp. 287-294**Aleksandar Ilic**, “Note on the harmonic index of a graph”, pp. 295-299**Wei-Juan Zhang and Jin-Xin Zhou**, “Automorphisms of the alternating group network”, pp. 301-307**Morteza Jafarpour, Irina Cristea and Ali Tavakoli**, “A method to compute the number of regular reversible Rosenberg hypergroup”, pp. 309-329**Xuehong Yin, Hong Bian and Haizheng Yu**, “The Co-PI index of some compound graphs”, pp. 331-339**Brian Y. Sun**, “On two Curious Sums of Triple Multiplication of Binomial Coefficients”, pp. 341-347**Michitaka Furuya and Naoya Kato**, “Upper bound on the diameter of a total domination vertex critical graph”, pp. 349-371**Hantao Zhang and Stanley Ziewacz**, “On Holey Schroder Designs of Type 2^{n}u^{1}“, pp. 373-401**Ping Li and Qiongxiang Huang**, “A sharp upper bound on the spectral radius of generalized weighted digraphs”, pp. 403-414**Nader Jafari Rad and Lutz Volkmann**, “Matchings in 4-total restrained domination vertex critical graphs”, pp. 415-428**Xuli Qi and Bo Zhou**, “A note on hyper-Wiener index”, pp. 429-438**Zhongxun Zhu and Wei Zhang**, “Trees with a given order and matching number that have maximum general sum-connectivity index”, pp. 439-446