**Xianglan Cao, Yingzhi Tian and Jixiang Meng**, "Construction of super edge-connected multigraphs with prescribed degrees", pp. 3-13**Carol J. Wang**, "Permutation Tableaux, Restricted Set Partitions and Labeled Dyck Paths", pp. 15-32**C. Jayasekaran**, "Self Vertex Switchings Of Trees", pp. 33-43**Min-Hui Liu, Gui-Xian Tian and Shu-Yu Cui**, "Some sharp bounds for the spectral radius and energy of digraphs", pp. 45-55**Rao Li**, "Hamiltonicity of L_{1}-Graphs with Bounded Dilworth Numbers", pp. 57-64**M. Goyal and A.K. Agarwal**, "On a new class of combinatorial identities", pp. 65-77**Hailong Hou and Rui Gu**, "Split graphs whose completely regular endomorphisms form a monoid", pp. 79-88**Wuyang Sun**, "p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth", pp. 89-100**H. Kutucu, F. Nuriyeva and O. Ugurlu**, "The Rainbow Connection Problem: Mathematical Formulations", pp. 101-108**Bo Wang, JinHao Luo and BiWu Fang**, "On the signed star domination numbers of trees", pp. 109-116**Jishe Feng**, "Hessenberg Matrices On Fibonacci And Tribonacci Numbers", pp. 117-124**Bart De Bruyn**, "Two-character sets as subsets of parabolic quadrics", pp. 125-132**Xiangnan Gong, Changqing Xu, Hongjie Song and Wenhua Pan**, "Neighbor sum distinguishing total choosability of a kind of sparse graph", pp. 133-141**Xing Huang**, "On implicit degree sum condition for long cycles", pp. 143-148**Raxida Guji and Tursun Ali**, "Toughness of Kronecker product of graphs", pp. 149-156**Yahui Yu and Yuan He**, "Some Recurrence Relations For q-Bernoulli Numbers And Polynomials", pp. 157-165**Kejun Chen, Wen Li, Guangzhou Chen and Ruizhong Wei**, "Regular sparse anti-magic squares with maximum density", pp. 167-183**Zoran Z. Petrovic and Zoran S. Pucanovic**, "The Line Graph Associated To The Total Graph Of A Commutative Ring", pp. 185-195**Chao Yang, Han Ren and Bing Yao**, "Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints", pp. 197-208**Caixia Song and Qiongxiang Huang**, "The Characteristic Polynomial of a kind of Hexagonal System and its Application", pp. 209-223**Ahmet Tekcan, Arzu Ozkoc, Merve Engur and Meltem E. Ozbek**, "On Algebraic Identities On A New Integer Sequence With Four Parameters", pp. 225-238**Sapna Jain**, "On Row-Cyclic Array Codes Detecting and Correcting CT-Bursts Array Errors", pp. 239-259**Li-fang Huo, Yan-bing Zhao and Yuan-ji Huo**, "Mobius Functions and Characteristic Polynomials of Subspace Lattices Under the Finite Classical Groups", pp. 261-269**M.A. Seoud and M.A. Salim**, "Upper Bounds of Four Types of Graph Labelings", pp. 271-278**Guifu Su**, "A new version for Co-PI Iindex of a graph", pp. 279-292**M.M.M. Jaradat**, "On the basis number of the wreath product of ladders", pp. 293-314**Shubo Chen and Jianguang Yang**, "Tricyclic graphs with minimum Kirchhoff Index", pp. 315-328**Sergio Falcon**, "On the powers of the k-Fibonacci numbers", pp. 329-338**Mingquan Zhan and Shuxin Zhan**, "Full Cycle Extendability of Nearly Claw-Free Graphs", pp. 339-356**Mohsen Jannesari and Behnaz Omoomi**, "Characterization of Randomly k-Dimensional Graphs", pp. 357-372**Jian Peng, Guoping Wang and Weijuan Zhang**, "Some indices of graphs with more than one cut-edge", pp. 373-386**Juan A. Rodriguez-Velazquez, Ismael G. Yero and Dorota Kuziak**, "The partition dimension of corona product graphs", pp. 387-399**Xinguo Cao and Erfang Shan**, "Paired-domination in claw-free graphs with minimum degree at least four", pp. 401-408**Jianxi Li, S. Balachandran, S.K. Ayyaswamy and Y.B. Venkatakrishnan**, "The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs", pp. 409-419**Zhendong Shao and Roberto Solis-Oba**, "A New Characterization of Disk Graphs and its Application", pp. 421-434**M.A. Seoud and M. Anwar**, "Some Families of Combination and Permutation Graphs", pp. 435-443

Back to the