**Ars Combinatoria****Volume XCIX, April, 2011**

**T. Aaron Gulliver**, “Quasi-Twisted Codes over F_{11}“, pp. 3-17**Wolfgang Haas**, “Lower bounds for quaternary covering codes”, pp. 19-23**K. Uslu, N. Taskara and H. Kose**, “The Generalized k-Fibonacci and k-Lucas Numbers”, pp. 25-32**S. Bonvicini and G. Mazzuoccolo**, “Perfect one-factorizations in generalized Petersen graphs”, pp. 33-43**Zhiwen Wang, Jaeun Lee, Jingwen Li and Fei Wen**, “The Smarandachely Adjacent Vertex Total Coloring of a kind of 3-regular Grapsh”, pp. 45-53**Lutz Volkmann**, “Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number”, pp. 55-64**Guanghui Wang and Guizhen Liu**, “Circular choosability of planar graphs with large girth”, pp. 65-73**A.P. Santhakumaran and P. Titus**, “Geodesic Graphs”, pp. 75-82**M. Bergerson, A. Miller, A. Pliml, V. Reiner, P. Shearer, D. Stanton and N. Switala**, “Note On 1-Crossing Partitions”, pp. 83-87**Maref Y.M. Alzoubi**, “The Basis Number of the Cartesian Product of Different Ladders”, pp. 89-95**Morteza Hivadi and Morteza Esmaeili**, “High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes”, pp. 97-107**Luca Ferrari, Elisa Pergola, Renzo Pinzani and Simone Rinaldi**, “Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method”, pp. 109-128**Ali Ahmad, Imran Javaid and M.F. Nadeem**, “Further results on super edge magic deficiency of unicyclic graphs”, pp. 129-138**K. Uslu, N. Taskara and H.H. Gulec**, “Combinatorial Sums of Generalized Fibonacci and Lucas Numbers”, pp. 139-147**A.A.G. Ngurah, E.T. Baskoro and I. Tomescu**, “Magic graphs with pendant edges”, pp. 149-160**Adel T. Diab**, “Genralization of Some Results on Cordial Graphs”, pp. 161-173**Lili Hu and Chunhui Lai**, “On Potentially (K_{5}– C_{4})-graphic Sequences”, pp. 175-192**Chen Shangdi and Zhao Dawei**, “Two Constructions of Multireceiver Authentication Codes from Symplectic Geometry over Finite Fields”, pp. 193-203**Louis M. Friedler**, “The Independence Number of the Cartesian Product of Graphs”, pp. 205-216**Yufa Shen, Jun Guo, Xin Xiao and Qing Tang**, “Nearly antipodal chromatc number of even paths”, pp. 217-224**G. Sethuraman and K. Sankar**, “On Graceful And Cordial Labeling Of Shell Graphs”, pp. 225-242**Jinhua Wang**, “Cube factorizations of complete multipartite graphs”, pp. 243-256**H. Roslan and Y.H. Peng**, “Chromaticity of Bipartite Graphs With Seven Edges Deleted”, pp. 257-277**Azizolla Azad and Mehdi Eliasi**, “Distance in the non-commuting graph of groups”, pp. 279-287**Iwao Sato**, “A Zeta Function Of A Semiregular Weighted Bipartite Graph”, pp. 289-301**Chin-Mei Fu, Yu-Fong Hsu and Wen-Chung Huang**, “The spectrum of 4-cycles in 2-factorizations of K_{n,n}“, pp. 303-320**Wongsakorn Charoenpanitseri, Narong Punnim and Chariya Uiyyasathian**, “On (k,t)-choosability of graphs”, pp. 321-333**Shaopu Zhang**, “On Candelabra Quadruple Systems”, pp. 335-352**Hong Lin**, “On the structure of graphs with exactly two near-perfect matchings”, pp. 353-358**Iwona Wloch and Andrzej Wloch**, “Genralized Padovan numbers, Perrin numbers and maximal k-indpendent sets in graphs”, pp. 359-364**Bart De Bruyn**, “A note on the spin-embedding of the dual polar space DQ-(2n+1, K)”, pp. 365-375**G.C. Lau, Y.H. Peng and H.H. Chu**, “Chromatic Uniqueness of Certain Complete 4-partite Graphs”, pp. 377-382**Flavia Bonomo and Mariano Cecowski Palacio**, “Between coloring and list-coloring: μ-coloring”, pp. 383-398**Muhammad Akram and Noura Omir Al-shehri**, “Fuzzy K-ideals of K-algebras”, pp. 399-413**Daphne Der-Fen Liu**, “Hamiltonian Spectra of Trees”, pp. 415-419**Lingqi Zhao, Siqintuya and Jirimutu**, “On The Gracefulness of The Digraphs n-C_{m}“, pp. 421-428**Christina Di Bari and Pasquale Vetro**, “Common Fixed Points In Cone Metric Spaces For MK-Pairs and L-Pairs”, pp. 429-437**A.K. Agarwal and G. Narang**, “Genralized Frobenius partitions and mock-theta functions”, pp. 439-444**Robert Brier and Darryn Bryant**, “On the existence and embedding of edge-coloured graph decompositions”, pp. 445-459**Pak Tung Ho**, “The crossing number of K_{1,1,3,n}“, pp. 461-471**Paul Manuel, Bharati Rajan, Indra Rajasingh and Chris M. Monica**, “Landmarks in Binary Tree Derived Architectures”, pp. 473-486**S.M. Hegde, Sudhakar Shetty and P. Shankaran**, “Further Results On Super Edge-Magic Deficiency Of Graphs”, pp. 487-502**Nuh Aydin and T. Aaron Gulliver**, “Some Good Cyclic and Quasi-Twisted Z_{4}-Linear Codes”, pp. 503-518**Ahmet Tekcan**, “The Elliptic Curves y^{2}= x(x-1)(x-λ)”, pp. 519-529