Vol. 67 (2005): Volume 67, 2005

Articles

• A new bound for the complexity of a graph: This note presents a new upper bound for the complexity of a graph in term of the edge number.

  Zhang, Xiao-Dong

• Packing the cartesian product of two complete graphs with hexagons

  Fu, Hung-Lin, Huang, Ming-Hway

• Realizability of the total domination criticality index

  Haynes T.W., Mynhardt C.M., Van Der Merwe L.C.

• Protection of a Graph

  Cockayne E.J., Grobler P.J.P., Grundlingh W.R., Munganga J., Van Vuuren J.H.

• Existence of complementary pairs of proportionally balanced designs

  Gray, Ken, Street, Anne Penfold, Harris, Karen, Ramsay, Colin

• The Ramsey numbers R(Tn, W6) for small n

  Chen, Yaojun, Zhang, Yunqing, Zhang, Kemin

• On paired and double domination in graphs

  Chellali, Mustapha, Haynes, Teresa W.

• An axiomatization of circuit theory

  Wilson, John C.

• Identities for the total number of parts in partitions of integers

  Knopfmacher, Arnold, Robbins, Neville

• Matchings in a simple square lattice

  Wahid S.A.

• On two classes of identities involving harmonic numbers

  Larcombe, Peter J., Larsen, Mogens E., Fennessey, Eric J.

• Excellent trees and secure domination

  Mynhardt C.M., Swart H.C., Ungerer E.

• Upper bounds on distance measures in K3,3-free graphs

  Dankelmann, Peter, Dlamini, Gcina, Swart, Henda C.

• An alternative representation of finite fields

  Mullin, Ronald C., Mahalanobis, Ayan

• A combinatorial identity involving stirling numbers of the second kind

  Grimaldi, Ralph

• Pretty drawings. More doodles and doilies, symmetric venn diagrams

  Hamburger, Peter

• Local colorings of graphs

  Chartrand, Gary, Saba, Farrokh, Salehi, Ebrahim, Zhang, Ping

• Nordhaus-gaddum bounds for domination sums in graphs with specified minimum degree

  Dunbar, Jean E., Haynes, Teresa W., Hedetniemi, Stephen T.

• Note on distances of posets whose double bound graphs are the same

  Ogawa, Kenjiro, Tsuchiya, Morimasa

• A new class of critical sets in Latin squares

  Cavenagh, Nicholas J., Donovan, Diane, Gower, Rebecca A.H.

• Constructing resolvable (v, 3, 3, 2) Lotto designs

  Li, Pak Ching

• An application of star polynomials to discrete random allocation problems

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

• Some binary codes from symplectic geometry of odd characteristic

  Key J.D., Moori J., Rodrigues B.G.

• All i-th Ramsey numbers for stars

  Benedict, James M.

• Some identities concerning self-conjugate partitions

  Robbins, Neville

• Signed domatic numbers of the complete bipartite graphs

  Volkmann, Lutz

• A remark on a conjecture for the (k, p)-domination number

  Fischermann, Miranca, Volkmann, Lutz