Articles
5-23
Paired domination in prisms of graphs
25-35
Notes on the independence number in the Cartesian product of graphs
37-44
Decomposition tree and indecomposable coverings
45-62
Radio numbers for generalized prism graphs
63-78
Cyclically k-partite digraphs and k-kernels
79-113
A magical approach to some labeling conjectures
129-142
The independent domination number of a random graph
143-159
Closure for spanning trees and distant area
161-170
Coloring rectangular blocks in 3-space
161-170
Weak roman domination in graphs
171-181
The forcing steiner number of a graph
183-195
Parity vertex colouring of graphs
197-202