In this paper, we shall represent a strong law of large numbers (SLLN) for weighted sums of set- valued random variables in the sense of the Hausdorff metric dH
A proper edge coloring of a graph is acyclic, if every cycle of the graph has at least 3 colors. Let r be a positive integer. An edge coloring is r-acyclic if i