**Ars Combinatoria****Volume CXLVII, October, 2019**

**Jinwei Wang and Yanfeng Luo**, “On the extendability of semi-Cayley graphs of finite abelian groups”, pp. 3-18**Xianglin Wei, Zihuan Guo and Weiqi Wang**, “On the number of interior F-points of convex F-polygon”, pp. 19-28**Junqing Cai and Panpan Wang**, “Implicit degree condition for dominating cycles”, pp. 29-42**Wipawee Tangjai**, “The minimum color degree and a large rainbow cycle in an edge-colored graph”, pp. 43-50**Hacène Belbachir, Nassira Souddi and Meriem Tigane**, “Combinatorial properties of the r-Whitney numbers of Dowling lattices”, pp. 51-62**Zongtian Wei, Jingting Yang, Yinkui Li and Chao Yue**, “Vertex-neighbor-toughness of the Cartesian Products of paths and cycles”, pp. 63-78**Salah Al-Addasi**, “Graphs having constant H-complements”, pp. 79-86**Daniele Bartoli, Alexander A. Davydov, Alexey A. Kreshchuk, Stefano Marcugini and Fernanda Pambianco**, “New upper bounds on the smallest size of a complete cap in the spaces PG(3,q) and PG(4,q) “, pp. 87-96**Xia Guo and Yan Yang**, “The Thickness of some Cartesian Product Graphs”, pp. 97-108**K. Pattabiraman**, “Forgotten Topologial Indices and its Co-indices of Graph Operations”, pp. 109-134**Mehrdad Nasernejad and Kazem Khashyarmanesh**, “Sets Defining Minimal Vertex Covers of Uniform Hypergraphs”, pp. 135-142**Ruby Nasir, Sohail Zafar and Zohaib Zahid**, “Edge metric dimension of graphs”, pp. 143-156**Ian Hart and Ping Zhang**, “Majestic 2-Tone Colorings of Graphs”, pp. 157-176**Yunyun Qu, Xiomin Bao and Huawei Huang**, “Some algebraic identities on a new integer sequence with four parameters”, pp. 175-188**Zhendong Shao and Igor Averbakh**, “Distance Constrained Labelings of Strong Product of n General Graphs”, pp. 189-202**Bo Deng and Xiaoyu Zhu**, “Minimal Balaban index on two classes of graphs”, pp. 203-214**K. Selvakumar and P. Subbulakshmi**, “On the Genus of Cayley Graph of Ideals of a Commutative Rings”, pp. 215-236**Venkata Ramana B, Subhashis Chatterjee and G. K. Vishwakarma**, “Estimation of network reliability using optimal ROBDD approach”, pp. 237-254**Weijun Liu and Nannan Zhang**, “The degree Kirchhoff index of weighted graphs “, pp. 255-262**A. Anu and S. Monikandan**, “Nearly all Biregular Graphs have Degree Associated Edge Reconstruction Number at most Three “, pp. 263-280**Ricky X. F. Chen**, “Signed relative derangements, reversal distance, and the signed Hultman numbers “, pp. 281-288**Mansour J. Algefari, Hong-Jian Lai, Juan Liu and Xindong Zhang**, “Supereulerian digraphs with forbidden induced subdigraphs containing short dipaths “, pp. 289-302**Huiping Cai, Juan Liu, Keshe Ni and Zhengyang Cao**, “Shortest paths in iterated line digraph of a complete bipartitie digraph”, pp. 303-312**Ming Chen and Yusheng Li**, “Linear list colorings of graphs with maximum average degrees bounded”, pp. 313-322**Bingjie Liu, Hong Bian and Haizheng Yu**, “The expected values of Hosoya index and Merrifield-Simmons index in random spiro chains “, pp. 323-336**Huimin Song, Hong-Jian Lai and Jainliang Wu**, “On r-hued coloring of graphs with maximum average degree less than 3”, pp. 337-360**Haining Jiang and Haiyun Wan**, “Target Set Selection in Cartesian product graphs “, pp. 361-374**Havva Kirgiz and Kemal Uslu**, “On the Generalized New Family of k-Pell Numbers”, pp. 375