VOL 111

Ars Combinatoria
Volume CXI, July, 2013

  • Chao Yang and Jun-Ming Xu, “Connectivity of lexicographic product and direct product of graphs”, pp. 3-12
  • Victor Kostyuk and Darren Narayan, “Maximum Minimal k-rankings of Cycles”, pp. 13-31
  • Martin Knor and Primoz Potocnik, “A note on 2-subset-regular self-complementary 3-uniform hypergraphs”, pp. 33-36
  • Haichao Wang and Erfang Shan, “Signed total k-domination in graphs”, pp. 37-52
  • Mustafa Asci and Esref Gurel, “Gaussian Jacobsthal And Gaussian Jacobsthal Lucas Numbers”, pp. 53-63
  • Xingchao Deng and Jixiang Meng, “The Diameters of Almost All Bi-Cayley Graphs”, pp. 65-74
  • Zemin Jin and Lifen Li, “Edge-colorings of complete bipartite graphs without large rainbow trees”, pp. 75-84
  • Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko and Preben Dahl Vestergaard, “Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees”, pp. 85-95
  • Abdollah Khodkar, B.P. Mobaraky and S.M. Sheikholeslami, “Roman domination subdivision number of a graph and its complement”, pp. 97-106
  • Yunsheng Zhang, Yichao Chen and Yanpei Liu, “On The Average Crosscap Number Of A Graph”, pp. 107-127
  • P. Jeyanthi and P. Selvagopal, “Some C4-supermagic graphs”, pp. 129-136
  • Hongxue Song, “Asymptotic upper bounds for K1,m,k complete graph Ramsey Numbers”, pp. 137-144
  • S. Akbari and S. Zare, “Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs”, pp. 145-159
  • Refik Keskin and Bahar Demirturk, “Solutions of Some Diophantine Equations Using Generalized Fibonacci and Lucas Sequences”, pp. 161-179
  • Christian Lowenstein, Dieter Rautenbach and Friedrich Regen, “Chiraptophobic Cockroaches evading a Torch Light”, pp. 181-192
  • Meng-Xiao Yin and Jian-Hua Yin, “A Characterization on Potentially K6-E(K3)-graphic Sequences”, pp. 193-206
  • Anita Pasotti, “On d-graceful labelings”, pp. 207-223
  • Jean-Luc Baril, “Gray code for permutations with a fixed number of left-to-right minima”, pp. 225-239
  • Tao Wang, Deming Li and Qing Wang, “Some classes of antimagic graphs with regular subgraphs”, pp. 241-250
  • Yuko Sanaka, “On γ-Labelings Of Complete Bipartite Graphs”, pp. 251-256
  • Abbas Heydari and Bijan Taeri, “On the Wiener index of rooted product of graphs”, pp. 257-264
  • Meirun Chen, Xiaofeng Guo and Shaohui Zhai, “Total chromatic number of folded hypercubes”, pp. 265-272
  • Alexander Giffen and Darren B. Parker, “On Generalizing the “Lights Out” Game and a Generalization of Parity Domination”, pp. 273-288
  • Yarong Wu, Hailiang Zhang and Bingbing Wang, “Graphs with fourth largest signless-Laplacian eigenvalue less than two”, pp. 289-303
  • P.J. Rowley and L.A. Walker, “Involution fixed sets of the M24 maximal 2-local geometry chamber graph”, pp. 305-313
  • Qing Cui and Lingping Zhong, “A note on circumferences in k-connected graphs with given independence number”, pp. 315-322
  • Miloud Mihoubi, “The role of binomial type sequences in determination identities for Bell polynomials”, pp. 323-337
  • Shubo Chen, Junfeng Li, Ren Lin and Hong Guo, “Extremal Wiener-Hosoya Index Of Acyclic Graphs With Short Diameter”, pp. 339-344
  • Urszula Bednarz, Dorota Brod, Krzysztof Piejko and Andrzej Wloch, “(k,αn-1)-Fibonacci numbers and Pk-matchings in multigraphs”, pp. 345-355
  • Dancheng Lu and Tongsuo Wu, “Endomorphism monoids of generalized split graphs”, pp. 357-373
  • Watcharintorn Ruksasakchai and Kittikorn Nakprasit, “On a conjecture about (k,t)-choosability”, pp. 375-387
  • Rabia Aktas, Fatma Tasdelen and Nuray Yavuz, “Bilateral And Bilinear Generating Functions For The Generalized Zernike Or Disc Polynomials”, pp. 389-400
  • Omar A. AbuGhneim, “On (64,28,12) Difference Sets”, pp. 401-419
  • Mukti Acharya and Tarkeshwar Singh, “Embedding Of Signed Graphs In Graceful Signed Graphs”, pp. 421-426
  • Lian-Cui Zuo, Bang-Jun Li and Jian-Liang Wu, “The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs”, pp. 427-444
  • Xiaowei Ai and Lin Zhang, “Some new results on the sum of squares of eccentricity in graphs”, pp. 445-451
  • Xianglan Cao, Litao Guo, Xiaofeng Guo and Jixiang Meng, “Super connectivity and super arc connectivity of the Mycielskian of a digraph”, pp. 453-461
  • Lutz Volkmann, “Smallest regular and almost regular triangle-free graphs without perfect matchings”, pp. 463-472
  • Yidong Sun, Shuang Wang and Xiao Guan, “Further Applications Of Hsu’s Summation Formula”, pp. 473-483
  • Bertran Steinsky, “Enumeration of Labelled Essential Graphs”, pp. 485-494
  • I.G. Yero and J.A. Rodriguez-Velazquez, “Boundary powerful k-alliances in graphs”, pp. 495-504
  • S. Akbari, D. Kiani, F. Mohammadi and S. Moradi, “Characterization of M3(2)-graphs”, pp. 505-513
  • Zhang Rui, Sun Yongqi and Wu Yali, “On the Four Color Ramsey Numbers for Hexagons”, pp. 515-522