Geodesic

Volume 31 (2011) no. 1

Sommaire

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