Vol. 65 (2004): Volume 65, 2004

Articles

• A physics-free introduction to quantum error correcting codes

  Martin, William J.

• Minimum dominating walks in Cartesian product graphs

  Hartnell B.L., Whitehead C.A.

• Designs for diallel crosses for test versus control comparisons

  Choi, Kuey Chung, Gupta, Sudhir, Kageyama, Sanpei

• Regular solutions of the n-queens problem on the torus

  Burger A.P., Mynhardt C.M., Cockayne E.J.

• Triallel-cross block designs that are robust: Against missing observations

  Bhar, Lalmohan, Dey, Amitava

• Connections between the matching, chromatic, adjoint and σ-polynomials

  Farrell E.J.

• The average eccentricity of a graph and its subgraphs

  Dankelmann, Peter, Goddard, Wayne, Swart, Christine S.

• On Voronoi's method for finding an integral basis of a cubic field

  Alaca, Şaban, Williams, Kenneth S.

• Construction of BP3-designs with mononumerical spectrum

  Gionfriddo, Lucia

• An application of path polynomials to discrete random allocation problems

  Farrell, Edward J., Gargano, Michael L., Quintas L.V.

• Almost-magic, relaxed-magic and magic strength of a graph

  Murugan M.

• On two-color partitions

  Robbins, Neville

• Inequivalent projections of some D-optimal designs

  Evangelaras H., Koukouvinos C.

• Critical sets in latin squares and related matters: An update

  Keedwell A.D.

• Asymptotic expressions of normalized laguerre matrix polynomials on bounded intervals

  Jódar L., Sastre J.

• On optimal fast solutions to the problem of gossiping by letters

  Salerni, Giulio

• The Oberwolfach problem for a unique 5-cycle and all others of length 3

  Sui, Qidi, Du, Beiliang

• Mutually nearly orthogonal Latin squares of order 6

  Pasles, Elise Burns, Raghavarao, Damaraju