Trees with large paired-domination number
Haynes, Teresa W.; Henning, Michael A.
Util. Math. 71, 3-12 (2006).
Extended Lucas cubes
Whitehead, Carol; Zagaglia Salvi, Norma
Util. Math. 71, 13-21 (2006).
Successive sums in smooth groups and smooth cyclic groups
Aktaş, Haci
Util. Math. 71, 23-31 (2006).
Repeated eigenvalues of the line graph of a tree and of its deck
Sciriha, Irene
Util. Math. 71, 33-35 (2006).
Some results about super edge-magic and (k,d)-arithmetic graphs and labelings
Muntaner-Batle, F. A.; Rius-Font, M.
Util. Math. 71, 57-64 (2006).
Multi-level supersaturated designs based on error-correcting codes
Georgiou, S.; Koukouvinos, C.; Mantas, P.
Util. Math. 71, 65-82 (2006).
The support sizes of MPT(v,3)
Gionfriddo, Lucia; Milici, Salvatore
Util. Math. 71, 83-95 (2006).
On the PI polynomial of a graph
Ashrafi, A. R.; Manoochehrian, B.; Yousefi-Azari, H.
Util. Math. 71, 97-108 (2006).
On Laguerre matrix polynomial series
Sastre, J.; Jódar, L.
Util. Math. 71, 109-130 (2006).
Super edge-antimagic total labelings
Sugeng, K. A.; Miller, M.; Bača, Martin
Util. Math. 71, 131-141 (2006).
Convexity, geodetic, and hull numbers of the join of graphs
Canoy, Sergio R. jun.; Cagaanan, Gilbert B.; Gervacio, Severino V.
Util. Math. 71, 143-159 (2006).
Protection of complete multipartite graphs
Benecke, S.; Grobler, P. J. P.; van Vuuren, J. H.
Util. Math. 71, 161-168 (2006).
k-step Fibonacci sequence modulo m
Lü, Kebo; Wang, Jun
Util. Math. 71, 169-171 (2006).
Constructions for rectangular designs
Ozawa, Kazuhiro; Mishima, Miwako; Kuriki, Shinji; Jimbo, Masakazu
Util. Math. 71, 179-196 (2006).
A computational algebraic approach for saturated D-optimal designs with n≡2(mod4) observations
Kotsireas, Ilias S.; Koukouvinos, Christos
Util. Math. 71, 197-207 (2006).
Bounds of the 2-domination number of graphs
Blidia, Mostafa; Chellali, Mustapha; Volkmann, Lutz
Util. Math. 71, 209-216 (2006).
Generalization of a combinatorial identity
Zhang, Zhizheng; Wang, Jun
Util. Math. 71, 217-224 (2006).
All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible
Ramachandran, S.; Monikandan, S.
Util. Math. 71, 225-234 (2006).
Domination parameters in Mycielski graphs
Chen, Xuegang; Xing, Huaming
Util. Math. 71, 235-244 (2006).
The crossing number of C(n;{1,⌊n/2⌋−1})
Lin, Xiaohui; Yang, Yuansheng; Lü, Jianguo; Hao, Xin
Util. Math. 71, 245-255 (2006).
Gaps in integer partitions
Knopfmacher, Arnold; Warlimont, Richard
Util. Math. 71, 257-267 (2006).
Face antimagic labelings of prisms
Sugeng, K. A.; Miller, M.; Lin, Yuqing; Bača, M.
Util. Math. 71, 269-286 (2006).
