**Ahmad Mahmood Qureshi**, "A New Version of Menages Problem", pp. 3-6**Shengxiang Lv and Yanpei Liu**, "A new bound on maximum genus of simple graphs", pp. 7-14**Mingjing Gao and Erfang Shan**, "The Signed Total Domination Number of Graphs", pp. 15-24**Jin-Hua Yang and Feng-Zhen Zhao**, "Values of a Class of Generalized Euler and Bernoulli Numbers", pp. 25-32**A.P. Santhakumaran and S. Athisayanathan**, "Weak Edge Detour Number of a Graph", pp. 33-61**Shuhua Li, Hong Bian, Guoping Wang and Haizheng Yu**, "Vertex PI indices of some sums of graphs", pp. 63-71**Xiaoxin Song and Weiping Shang**, "Roman domination in a tree", pp. 73-82**Weiping Wang and Tianming Wang**, "Matrices related to the idempotent numbers and the numbers of planted forests", pp. 83-96**H. Cao and Y. Wu**, "Simple Kirkman Packing Designs SKPD({3,4},v) with index two", pp. 97-111**Yuan Xudong, Li Ting-ting and Su Jianji**, "The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs", pp. 113-127**Emrah Kilic and Nurettin Irmak**, "Binomial Identities Involving The Generalized Fibonacci Type Polynomials", pp. 129-134**Suogang Gao and Jun Guo**, "A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs", pp. 135-148**Xi Yue, Yang Yuan-sheng and Meng Xin-hong**, "Skolem-Gracefulness of k-Stars", pp. 149-160**Ming-Ju Lee, Chiang Lin and Wei-Han Tsai**, "On Antimagic Labeling For Power of Cycles", pp. 161-165**Hong Bian, Fuji Zhang, Guoping Wang and Haizheng Yu**, "Extremal polygonal cactus chain concerning k-independent sets", pp. 167-172**Kenta Ozeki and Tomoki Yamashita**, "Dominating cycles in triangle-free graphs", pp. 173-182**Jian-Liang Wu and Yu-Wen Wu**, "Edge colorings of planar graphs with maximum degree five", pp. 183-191**Yunshu Gao, Jin Yan and Guojun Li**, "On 2-Factors with Chorded Quadrilaterals in Graphs", pp. 193-201**H. Roslan and Y.H. Peng**, "Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted", pp. 203-213**Iwona Wloch**, "On kernels by monochromatic paths in D-join", pp. 215-224**Rene Schott and George Stacey Staples**, "Nilpotent Adjacency Matrices and Random Graphs", pp. 225-239**Xuechao Li**, "A new lower bound on critical graphs with maximum degree of 8 and 9", pp. 241-257**Petros Hadjicostas and K.B. Lakshmanan**, "Measures of disorder and straight insertion sort with erroneous comparisons", pp. 259-288**Rao Li**, "Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers", pp. 289-294**Sibel Ozkan**, "Generalization of the Erdos-Gallai Inequality", pp. 295-302**Lihua Feng**, "Spectral radius of graph with given diameter", pp. 303-308**Lihua Feng and Guihai Yu**, "Erratum to: A note on the eigenvalues of graphs ", p. 309**Mingqing Zhai, Ruifang Liu and Jinlong Shu**, "On the (Laplacian) spectral radius of bipartite graphs with given number of blocks", pp. 311-319**Bart De Bruyn**, "The valuations of the near 2n-gon I_{n}", pp. 321-336**Renwang Su and Hung-Lin Fu**, "Embeddings of Maximum Packings of Triples", pp. 337-351**Hortensia Galeana-Sanchez and Rocio Sanchez-Lopez**, "H-kernels in the D-join", pp. 353-377**R.S. Manikandan, P. Paulraja and S. Sivasankar**, "Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs", pp. 379-386**Hongyu Chen, Xuegang Chen and Xiang Tan**, "On k-connected restrained domination in graphs", pp. 387-397**Selvam Avadayappan and P. Santhi**, "Some results on neighbourhood highly irregular graphs", pp. 399-414**Yunshu Gao and Guojun Li**, "On the Maximum Number of Disjoint Chorded Cycles in Graphs", pp. 415-422**Jianqin Zhou**, "An algorithm to find k-tight optimal double-loop networks", pp. 423-432**Zheng Wenping, Lin Xiaohui, Yang Yuansheng and Yang Xiwu**, "The Crossing Numbers of Cartesian Product of Cone Graph C_{m}+ K_{l}with Path P_{n}", pp. 433-445**Takao Komatsu**, "On the sum of reciprocal Tribonacci numbers", pp. 447-459**Xiang-Feng Pan, Meijie Ma and Jun-Ming Xu**, "Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs", pp. 461-470**Miao Lianying**, "On the Independence Number of Edge Chromatic Critical Graphs", pp. 471-481**Zhao Zhang and Fengxia Liu**, "Isoperimetric Edge Connectivity of Line Graphs and Path Graphs", pp. 483-491**Maggy Tomova and Cindy Wyels**, "Pebbling Graph Products", pp. 493-499**Paul Manuel and Indra Rajasingh**, "Minimum Metric Dimension of Silicate Networks", pp. 501-510**Jianchu Zeng and Yanpei Liu**, "Genus Distributions For Double Pearl-Ladder Graphs", pp. 511-520**Vito Abatangelo and Bambina Larato**, "Complete Arcs In Moulton Planes Of Odd Order", pp. 521-527

Back to the