Vol. 78 (2009): Volume 78, 2009

Articles

• A short proof of a littlewood-paley inequality in the unit ball

  Stević, Stevo

• The smallest degree sum that yields potentially K r1,r2,...,rl,2,s-graphic sequences

  Yin, Jian-Hua, Yin, Meng-Xiao

• The smallest degree sum that yields potentially K r1,r2,...,rl,2,s-graphic sequences

  Yin, Jian-Hua, Yin, Meng-Xiao

• Normalized embedding of path-like trees

  Bača, Martin, Lin, Yuqing, Muntaner-Batle, Erancesc A.

• Domination number of toroidal grid digraphs

  Shaheen, Ramy S.

• Bounds on g(5)1(v) for v = 9,13,17 (mod 20)

  Grannell M.J., Griggs T.S., Stanton R.G.

• Complete bipartite Ramsey numbers

  Hasmawati, Assiyatun H., Baskoro E.T., Salman A.N.M.

• An improved upper bound for signed edge domination numbers in graphs

  Karami H., Khodkar, Abdollah, Sheikholeslami S.M.

• On three types of embedding of pseudowheels on the projective plane

  Yang, Yan, Liu, Yanpei

• Uniform k-distant even trees are harmonious

  Abueida, Atif, Roberts, Dan

• Bounds on the order of 4-critical graphs with diameter two

  Van Der Merwe, Lucas, Loizeaux, Marc

• Kamenev-type oscillation criteria for even order delay differential equations

  Xu, Zhiting

• α-resolvable group divisible designs with block size four and groups size six and nine

  Meng, Zhaoping, Du, Beiliang

• Monophonic and m-hull number of the cartesian product of graphs

  Paluga, Esamel M.

• New proof of a combinatorial identity on stirling numbers of the second kind

  Wang, Jun, Zhang, Caihuan

• Covering cover pebbling number

  Lourdusamy A., Punitha Tharani A.

• Minimum dominating walks on graphs with large circumference

  Hartnell B.L., Whitehead C.A.

• Computational complexity of pseudoachromatic number of graphs

  Yegnanarayanan V.

• Inequivalent hadamard matrices from base sequences

  Kotsireas I.S., Koukouvinos C., Simos D.E.

• On a cyclic sequence of a packing by triples with error correcting consecutive unions

  Momihara, Koji, Jimbo, Masakazu

• On graceful chain graphs

  Barrientos, Christian

• Domination in prisms of graphs: Universal fixers Mynhardt C.M.aSend mail to Mynhardt C.M.;Xu, Zhixiab, cSend mail to Xu Z.

  Mynhardt C.M., Xu, Zhixia

• On the automorphism group of a possible symmetric (81,16,3) design

  Abdollahi A., Maimani H.R., Torabi R.

• Double domination edge critical graphs

  Haynes, Teresa W., Thacker, Derrick

• On covering radius of a family of codes Cm U (1 + Cm) with maximum distance between Cm and 1 + Cm

  Esmaeili M., Zaghian A.