Journal Volumes: Volume 48 (2010)

  • Anne Penfold Street
    • Ralph Gordon Stanton, p.3
  • S.B. Rao, B.D. Acharya, T. Singh and Mukti Acharya
    • Hypergraceful complete graphs, p.5
  • Kim A.S. Factor and Larry J. Langley
    • Digraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths, p.25
  • K.T. Arasu, I.S. Kotsireas, C. Koukouvinos and J. Seberry
    • On circulant and two-circulant weighing matrices, p.43
  • Andrew Hudson and Tim Penttila
    • A family of translation planes, p.53
  • Mark Ramras
    • Balanced independent sets in hypercubes, p.57
  • W{l}odzimierz Ulatowski
    • All graphs with restrained domination number three less than their order, p.73
  • David Auger, Ir`ene Charon, Olivier Hudry and Antoine Lobstein
    • On the sizes of the graphs $G$, $G^r$, $G^r\setminus G$: the directed case, p.87
  • Jingyu Wang, Jianping Ou and Tiedan Zhu
    • On restricted edge connectivity of regular Cartesian product graphs, p.111
  • Yuri Yoshida and Tatsuya Maruta
    • An extension theorem for $[n,k,d]_d$ codes with gcd$(d,q)=2$, p.117
  • Harout Aydinian, {'E}va Czabarka, Konrad Engel, P'{e}ter L. Erd{H o}s and L{'a}szl{'o} A. Sz{'e}kely
    • A note on full transversals and mixed orthogonal arrays, p.133
  • Ian T. Roberts, Leanne J. Rylands, Terry Montag and Martin Gr"{u}ttm"{u}ller
    • On the number of minimal completely separating systems and antichains in a Boolean lattice, p.143
  • Anders Claesson, Sergey Kitaev, K'ari Ragnarsson and Bridget Eileen Tenner
    • Boolean complexes for Ferrers graphs, p.159
  • B. Chaluvaraju, M. Chellali and K.A. Vidya
    • Perfect $k$-domination in graphs, p.175
  • Araya Chaemchan
    • The edge domination number of connected graphs, p.185
  • Michael J. Ferrara, Michael S. Jacobson and Angela K. Harlan
    • Hamiltonian cycles avoiding sets of edges in a graph, p.191
  • Laura J. Culp and Richard H. Hammack
    • An isomorphism theorem for digraphs, p.205
  • Grant Cairns and Nhan Bao Ho
    • Ultimately bipartite subtraction games, p.213
  • Michael Giudici and Aedan Pope
    • The diameters of commuting graphs of linear groups and matrix rings over the integers modulo $m$, p.221
  • Mostafa Blidia and Lyes Ould-Rabah
    • Bounds on the domination number in oriented graphs, p.231
  • Judy-anne Osborn
    • Bi-banded paths, a bijection and the Narayana numbers, p.243
  • Csilla Bujt'as and Zsolt Tuza
    • Voloshin's conjecture for C-perfect hypertrees, p.253
  • Zhaohong Niu and Liming Xiong
    • Even factor of a graph with a bounded number of components, p.269
  • Lakoa Fitina, C.T. Lenard and T.M. Mills
    • A note on the connectivity of the Cartesian product of graphs, p.281
  • Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali and Fr'{e}d'{e}ric Maffray
    • Double domination edge removal critical graphs, p.285