Ars Combinatoria
Volume CXXXV, October, 2017

  • Murat Ersen Berberler and Zeynep Nihan Berberler, “Measuring the vulnerability in networks: a heuristic approach”, pp. 3-15
  • Xia Zhang, “The correlation between the f-chromatic class of the gc-chromatic class of a simple graph”, pp. 17-28
  • Lili Song and Lei Sun, “Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable”, pp. 29-38
  • A. Elsonbaty and K. Mohamed, “On Some Variants of Gracefulness of Cycle Graphs”, pp. 39-50
  • Shumin Zhang, “On the path edge-connectivity of graphs”, pp. 51-69
  • Jing Jin and Baogang Xu, “Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles”, pp. 71-81
  • S. Uygun, “The Combinatorial Representation of Jacobsthal and Jacobsthal Lucas Matrix Sequences”, pp. 83-92
  • Yu-hong Guo, “The Inverse-conjugate Compositions With Odd Parts”, pp. 93-102
  • Chiara Mancini and Mauro Zannetti, “21=9+12: PG(2,4)=AG(2,3)+DAG(2,3)”, pp. 103-108
  • Jianxin Wei, “All good (bad) words consisting of four blocks”, pp. 109-118
  • Taekyun Kim, Dmitry V. Dolgy, Dae San Kim and Jong Jin Seo, “Convolved Fibonacci Numbers And Their Applications”, pp. 119-131
  • R. Sundara Rajan, Indra Rajasingh, Michael Arockiaraj, T.M. Rajalaxmi and B. Mahavir, “Embedding of Hypercubes into Generalized Books”, pp. 133-151
  • Sizhong Zhou, Yang Xu and Fan Yang, “Toughness for the existence of k-Hamiltonian [a,b]-factors”, pp. 153-161
  • Walter Carballosa, Jose M. Rodriguez, Jose M. Sigarreta and Yadira Torres-Nunez, “Computing the alliance polynomial of a graph”, pp. 163-185
  • Bo Ning, “On some papers of Nikiforov”, pp. 187-195
  • V.L. Stella Arputha Mary, S. Navaneethakrishnan and A. Nagarajan, “Strong Z4p-Magic labeling”, pp. 197-211
  • Quan-Hui Yang, “A refinement of Guo’s theorem concerning divisibility properties of binomial coefficients”, pp. 213-221
  • Helin Gong and Metrose Metsidik, “Constructions of pairs of Tutte-equivalent graphs”, pp. 223-234
  • Mohammadreza Rostami and Modjtaba Ghorbani, “Molecular graphs with extremal first geometric-arithmetic index”, pp. 235-242
  • Guoliang Hao, “Rainbow connection of the join of two paths”, pp. 243-247
  • Mobeen Munir, Abdul Rauf Nizami, Zaffar Iqbal and Huma Saeed, “Metric Dimension of the Mobius Ladder”, pp. 249-256
  • Maorong Sun and Lily J. Jin, “Proof of a conjecture on the Catalan-Larcombe-French numbers”, pp. 257-263
  • Zhongmei Qin, Jianfeng Wang and Kang Yang, “Oriented Bicyclic Graphs with the First Five Large Skew Energies”, pp. 265-282
  • Amalorpava Jerline J, Benedict Michaelraj L, Dhanalakshmi K and Syamala P, “Harmonic index of graphs with more than one cut-vertex”, pp. 283-298
  • Jinko Kanno, Naoki Matsumoto, Jianning Su and Ko Yamamoto, “Diagonal transformations in pentangulations on the sphere”, pp. 299-310
  • Victor J.W. Guo and Ya-Zhen Wang, “Some q-Dixon-like summation formula”, pp. 311-322
  • Omar Saeed Al-Mushayt, “On edge irregularity strength of products of certain families of graphs with path P2“, pp. 323-334
  • Zai Ping Lu and Ying Bin Ma, “The Rainbow Vertex Connectivities Of Small Cubic Graphs”, pp. 335-343
  • Esref Gurel and Mustafa Asci, “Some Properties of k-Order Gaussian Fibonacci And Lucas Numbers”, pp. 345-356
  • Lutz Volkmann, “Lower bounds on the signed k-domination number of graphs”, pp. 357-367
  • Li-Meng Xia, Yuanlin Li and Jiangtao Peng, “Minimal Zero-Sum Sequences Of Length Five Over Cyclic Groups Of Prime Power Order”, pp. 369-390
  • Kursat Aker and Aysin Erkan Gursoy, “A New Combinatorial Identity for Catalan Numbers”, pp. 391-398
  • Yaping Mao, Chengfu Ye, Hengzhe Li and Shumin Zhang, “The chromatic equivalence class of graph ψn3(n-3,1)”, pp. 399-421