Volume 48 (2010)

  • Anne Penfold Street
  • S.B. Rao, B.D. Acharya, T. Singh and Mukti Acharya
  • Kim A.S. Factor and Larry J. Langley
    • Digraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths, p.25
    • Download Full Text (355Kb pdf)
  • K.T. Arasu, I.S. Kotsireas, C. Koukouvinos and J. Seberry
  • Andrew Hudson and Tim Penttila
  • Mark Ramras
  • Włodzimierz Ulatowski
    • All graphs with restrained domination number three less than their order, p.73
    • Download Full Text (486Kb pdf)
  • David Auger, Irène Charon, Olivier Hudry and Antoine Lobstein
    • On the sizes of the graphs $G$, $G^r$, $G^r\setminus G$: the directed case, p.87
    • Download Full Text (385Kb pdf)
  • Jingyu Wang, Jianping Ou and Tiedan Zhu
    • On restricted edge connectivity of regular Cartesian product graphs, p.111
    • Download Full Text (97Kb pdf)
  • Yuri Yoshida and Tatsuya Maruta
    • An extension theorem for $[n,k,d]_d$ codes with gcd$(d,q)=2$, p.117
    • Download Full Text (190Kb pdf)
  • Harout Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdős and László A. Székely
    • A note on full transversals and mixed orthogonal arrays, p.133
    • Download Full Text (128Kb pdf)
  • Ian T. Roberts, Leanne J. Rylands, Terry Montag and Martin Grüttmüller
    • On the number of minimal completely separating systems and antichains in a Boolean lattice, p.143
    • Download Full Text (176Kb pdf)
  • Anders Claesson, Sergey Kitaev, Kári Ragnarsson and Bridget Eileen Tenner
  • B. Chaluvaraju, M. Chellali and K.A. Vidya
  • Araya Chaemchan
  • Michael J. Ferrara, Michael S. Jacobson and Angela K. Harlan
    • Hamiltonian cycles avoiding sets of edges in a graph, p.191
    • Download Full Text (155Kb pdf)
  • Laura J. Culp and Richard H. Hammack
  • Grant Cairns and Nhan Bao Ho
  • Michael Giudici and Aedan Pope
    • The diameters of commuting graphs of linear groups and matrix rings over the integers modulo $m$, p.221
    • Download Full Text (132Kb pdf)
  • Mostafa Blidia and Lyes Ould-Rabah
    • Bounds on the domination number in oriented graphs, p.231
    • Download Full Text (147Kb pdf)
  • Judy-anne Osborn
    • Bi-banded paths, a bijection and the Narayana numbers, p.243
    • Download Full Text (147Kb pdf)
  • Csilla Bujtás and Zsolt Tuza
  • Zhaohong Niu and Liming Xiong
    • Even factor of a graph with a bounded number of components, p.269
    • Download Full Text (139Kb pdf)
  • Lakoa Fitina, C.T. Lenard and T.M. Mills
    • A note on the connectivity of the Cartesian product of graphs, p.281
    • Download Full Text (77Kb pdf)
  • Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali and Frédéric Maffray