Sommaire

Paired domination in prisms of graphs
p. 5
Notes on the independence number in the Cartesian product of graphs
p. 25
Decomposition tree and indecomposable coverings
p. 37
Radio numbers for generalized prism graphs
p. 45
Cyclically k-partite digraphs and k-kernels
p. 63
A magical approach to some labeling conjectures
p. 79
The independent domination number of a random graph
p. 129
Closure for spanning trees and distant area
p. 143
Coloring rectangular blocks in 3-space
p. 161
Weak roman domination in graphs
p. 161
The forcing steiner number of a graph
p. 171
Parity vertex colouring of graphs
p. 183
A characterization of locating-total domination edge critical graphs
p. 197