  In this paper we are defining a special class of graphs called multilayered
graphs and its subclass, multilayered cycles. For that subclass of graphs we
are giving the values of all vertex spans (strong, direct, or Cartesian span).
Surprisingly, our results reveal that, irrespective of the chosen movement
rules, the span values only depend on the length of the individual cycles, not
the number of layers, which holds significant implications.
