VOL 90

Ars Combinatoria
Volume XC, January, 2009

  • Jerzy Zurawiecki, “Canonical form of the universal circuits matrix of feedback functions”
  • Xirong Xu, Yang Yuansheng, Lizhong Han and Li Huijun, “The Graphs C(t)13 are Graceful for t = 0, 3 (mod 4)”
  • Eric Duchene, Sylvain Gravier and Mehdi Mhalla, “Combinatorial graph games”
  • Xiaoping Liu, Xinhui An and Baoyindureng Wu, “On perfect matchings of complements of line graphs”
  • H. Yousefi-Azari, A.R. Ashrafi and N. Sedigh, “On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures”
  • Michael A. Henning, “Restricted total domination in graphs with minimum degree two”
  • Simone Severini, “Graphs of unitary matrices”
  • Dan Saracino and Brian Wynne, “The 2-color Rado Number of x + y + kz = 3w”
  • Hikoe Enomoto and Jun Fujisawa, “Fan-type theorem for a long path passing through a specified vertex”
  • Xiuli Li, “On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound”
  • Daniele Parisse, “On Some Metric Properties of the Sierpinski Graphs S(n,k)”
  • Jirimutu and Jun Wang, “On (a,d)-Antimagic Labelings of Generalized Petersen Graphs P(n,2)”
  • Daniel Daly and Petr Vojtechovsky, “How Permutations Displace Points And Stretch Intervals”
  • Yanling Shao and Yubin Gao, “The exponents of double vertex graphs”
  • Nihal Yilmaz Ozgur, “On The Power Subgroups Of The Modular Group”
  • Shoucang Li and Yubin Gao, “Two new classes of spectrally arbitrary sign patterns”
  • J.S. Parihar, Sushma Jain and Sfurti Awasthi, “Some Methods Of Construction Of Rectangular Designs”
  • Jingzhi Yan and Heping Zhang, “A Note on Path-Matchings”
  • Sermsri Thaithae and Narong Punnim, “The Hamiltonian number of graphs with prescribed connectivity”
  • Hua Mao, “Paving matroids of arbitrary cardinality”
  • Stavros D. Nikolopoulos and Charis Papadopoulos, “Counting Spanning Trees in Cographs: An Algorithmic Approach”
  • P. Delgado-Escalante and H. Galeana-Sanchez, “Alternating Domination In Arc-Colored Digraphs”
  • Guoping Wang and Qiongxiang Huang, “On the choosability of bipartite graphs”
  • Xiumei Wang, Zhenkun Zhang and Yixun Lin, “Degree-type Conditions for Bipartite Matching Extendability”
  • Daphne Der-Fen Liu and Melanie Xie, “Radio Number for Square Paths”
  • Zoran Stanic, “Some Results On Q-Integral Graphs”
  • Xiaodong Xu, Zehui Shao and Stanislaw P. Radziszowski, “Bounds on Some Ramsey Numbers Involving Quadrilateral”
  • Xiaoling Zhang and Heping Zhang, “The Laplacian spectral radius of unicyclic graphs with k pendent vertices”
  • Yanling Shao and Yubin Gao, “The local bases of primitive non-powerfull signed symmetric digraphs with loops”
  • Ebrahim Salehi and Shipra De, “On a Conjecture Concerning the Friendly Index Sets of Trees”
  • Yubin Gao, Yihua Huang and Yanling Shao, “Bases of primitive non-powerful signed symmetric digraphs with loops”
  • Wen Liu, Yafan Yue and Suogang Gao, “Some Properties of Macula’s matrix and its complement”
  • Bao-Xing Chen, Ji-Xiang Meng and Wen-Jun Xiao, “A diameter formula for an undirected double-loop network”
  • Jian-Hua Yin and Jiong-Sheng Li, “Potentially K-pr+1-graphic sequences”
  • Xirong Xu, Jun-Ming Xu, Min Lu, Zhang Baosheng and Cao Nan, “On (a,d)-Antimagic Labelings of Generalized Petersen Graphs”
  • Ahmad Mahmoody, “A Note on Graceful Graphs with Large Chromatic Numbers”
  • Yubin Gao and Yanling Shao, “Bound on the exponents of a class of two-colored digraphs”