Ars Combinatoria
Volume CXXIV, January, 2016
- J. Amjadi, S.M. Sheikholeslami and L. Volkmann, “Rainbow restrained domination numbers in graphs”, pp. 3-19
- Thomas Y.H. Liu and J.X. Meng, “Maximally connected and super arc-connected Bi-Cayley digraphs”, pp. 21-31
- Walter O. Krawec, “Modular Multiplicative Graphs”, pp. 33-40
- Wei Zhuang, Weihua Yang and Xiaofeng Guo, “On total domination number of Cartesian product of directed cycles”, pp. 41-48
- Rija Erves and Janez Zerovnik, “Mixed connectivity of Cartesian graph products and bundles”, pp. 49-64
- Tianyong Han, Zehui Shao, Enqiang Zhu, Zepeng Li and Fei Deng, “Star coloring of Cartesian product of paths and cycles”, pp. 65-84
- Christopher S. Withers and Saralees Nadarajah, “Stirling numbers and some partial sums of powers and products”, pp. 85-93
- Xiaodong Chen, MingChu Li, Wei Liao and Hajo Broersma, “Hamiltonian properties of almost locally connected claw-free graphs”, pp. 95-109
- Muhammad Imran, A.Q. Baig and Syed Ahtsham Ul Haq Bokhary, “On the metric dimension of rotationally-symmetric graphs”, pp. 111-128
- Ligong Wang and Xuran Zhou, “The smallest Merrifield-Simmons index of trees with exactly six leaves”, pp. 129-151
- S.M. Mirafzal, “Some Other Algebraic Properties Of Folded Hypercubes”, pp. 153-159
- Olof Heden and Papa A. Sissokho, “On the existence of a (2,3)-spread in V(7,2)”, pp. 161-164
- R. Barzgar P., A. Erfanian and M. Farrokhi D.G., “Probability Of Mutually Commuting Two Finite Subsets Of A Finite Group”, pp. 165-176
- Dan Guo, “The Relationship between Series Σni=1im and the Eulerian Numbers”, pp. 177-181
- Shubo Chen, “Extremal cactuses for the Schultz and modified Schultz indices”, pp. 183-192
- M.S.A. Bataineh, M.M.M. Jaradat and I.Y.A. Al-Shboul, “Edge-Maximal Graphs Without θ5-Graphs”, pp. 193-207
- Fuqin Zhan and Youfu Qiao, “On the sum-connectivity spectral radius and sum-connectivity Estrada index of graphs”, pp. 209-223
- M.H. Hooshmand, “A Combinatorial Identity And Its Related Conjecture”, pp. 225-227
- Jenq-Jong Lin, “Packing and covering λ-fold complete symmetric digraphs with 6-circuits”, pp. 229-238
- Nazli Besharati, J.B. Ebrahimi and A. Azadi, “Independence number of generalized Petersen graphs”, pp. 239-255
- Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian and Jixiang Meng, “On the page number of triple-loop networks with even cardinality”, pp. 257-266
- Mehmet Ali Ozturk, Hasret Yazarli and Mustafa Uckun, “A Note On Derivations In Subtraction Algebras”, pp. 267-276
- Zhongxun Zhu, “The extremal unicyclic graphs with perfect matching with respect to Hosoya index and Merrifield-Simmons index “, pp. 277-287
- S. Monikandan and J. Balakumar, “On pairs of graphs having n-2 cards in common”, pp. 289-302
- Aijun Dong, Qingsong Zou and Guojun Li, “Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree”, pp. 303-311
- S. Parameshwara Bhatta and Shiju George, “The N-Fixed Point Property In Posets”, pp. 313-318
- Qin Chen, “A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Some Cubic Graphs”, pp. 319-327
- Radoslav Kirov and Ramin Naimi, “List Coloring And n-Monophilic Graphs”, pp. 329-340
- Pak Ching Li, “Antimagic labelings of cycle powers”, pp. 341-351
- Mikko Pelto, “On locating-dominating codes in the infinite king grid”, pp. 353-363
- Zhendong Shao and Roberto Solis-Oba, “On some results for the L(2,1)-labeling on Cartesian sum graphs”, pp. 365-377
- Zhiwen Wang, “On the adjacent vertex distinguishing edge chromatic number of graphs”, pp. 379-388
- Zhen-Bin Gao, “The Super Vertex-Graceful Labeling Of Graphs”, pp. 389-400
- Chunlin Liu and Baodi Li, “Bicoloured ordered trees, non-nesting partitions and non-crossing partitions”, pp. 401-408
- Agata Kucienska, Magdalena Lemanska and Joanna Raczek, “Weakly convex and convex domination numbers of some products of graphs”, pp. 409-420
- Guanglong Yu, Yarong Wu and Jinlong Shu, “Minimizing the least eigenvalue of bicyclic graphs with fixed diameter”, pp. 421-437
- S. Akbari, F. Khaghanpoor and S. Moazzeni, “Colorful Paths in Vertex Coloring of Graphs”, pp. 439-447