Realizability of the total domination criticality index
Haynes, T. W.; Mynhardt, C. M.; van der Merwe, L. C.
Util. Math. 67, 3-8 (2005).
Identities for the total number of parts in partitions of integers
Knopfmacher, Arnold; Robbins, Neville
Util. Math. 67, 9-18 (2005).
Protection of a graph
Cockayne, E. J.; Grobler, P. J. P.; Gründlingh, W. R.; Munganga, J.; van Vuuren, J. H.
Util. Math. 67, 19-32 (2005).
Matchings in a simple square lattice
Wahid, S. A.
Util. Math. 67, 33-42 (2005).
Existence of complementary pairs of proportionally balanced designs
Gray, Ken; Street, Anne Penfold; Harris, Karen; Ramsay, Colin
Util. Math. 67, 43-64 (2005).
On two classes of identities involving harmonic numbers
Larcombe, Peter J.; Larsen, Mogens E.; Fennessey, Eric J.
Util. Math. 67, 65-80 (2005).
An application of star polynomials to discrete random allocation problems
Gargano, Michael L.; Quintas, L. V.
Util. Math. 67, 81-96 (2005).
Nordhaus-Gaddum bounds for domination sums in graphs with specified minimum degree
Dunbar, Jean E.; Haynes, Teresa W.; Hedetniemi, Stephen T.
Util. Math. 67, 97-105 (2005).
Local colorings of graphs
Chartrand, Gary; Saba, Farrokh; Salehi, Ebrahim; Zhang, Ping
Util. Math. 67, 107-120 (2005).
Some binary codes from symplectic geometry of odd characteristic
Key, J. D.; Moori, J.; Rodrigues, B. G.
Util. Math. 67, 121-128 (2005).
Packing the Cartesian product of two complete graphs with hexagons
Fu, Hung-Lin; Huang, Ming-Hway
Util. Math. 67, 129-140 (2005).
Some identities concerning self-conjugate partitions
Robbins, Neville
Util. Math. 67, 141-146 (2005).
All ith Ramsey numbers for stars
Benedict, James M.
Util. Math. 67, 147-152 (2005).
Note on distances of posets whose double bound graphs are the same
Ogawa, Kenjiro; Tsuchiya, Morimasa
Util. Math. 67, 153-160 (2005).
On paired and double domination in graphs
Chellali, Mustapha; Haynes, Teresa W.
Util. Math. 67, 161-171 (2005).
Constructing resolvable (v,3,3,2) lotto designs
Li, Pak Ching
Util. Math. 67, 173-183 (2005).
An axiomatization of circuit theory
Wilson, John C.
Util. Math. 67, 185-199 (2005).
A new bound for the complexity of a graph
Zhang, Xiao-Dong
Util. Math. 67, 201-203 (2005).
Upper bounds on distance measures in K3,3-free graphs
Dankelmann, Peter; Dlamini, Gcina; Swart, Henda C.
Util. Math. 67, 205-221 (2005).
A remark on a conjecture for the (k,p)-domination number
Fischermann, Miranca; Volkmann, Lutz
Util. Math. 67, 223-227 (2005).
Pretty drawings. More doodles and doilies, symmetric Venn diagrams
Hamburger, Peter
Util. Math. 67, 229-254 (2005).
Excellent trees and secure domination
Mynhardt, C. M.; Swart, H. C.; Ungerer, E.
Util. Math. 67, 255-267 (2005).
The Ramsey numbers R(Tn,W6) for small n
Chen, Yaojun; Zhang, Yunqing; Zhang, Kemin
Util. Math. 67, 269-284 (2005).
A new class of critical sets in Latin squares
Cavenagh, Nicholas J.; Donovan, Diane; Gower, Rebecca A. H.
Util. Math. 67, 285-300 (2005).
A combinatorial identity involving Stirling numbers of the second kind
Grimaldi, Ralph
Util. Math. 67, 301-303 (2005).
An alternative representation of finite fields
Mullin, Ronald C.; Mahalanobis, Ayan
Util. Math. 67, 305-318 (2005).
