  Consider the restricted Hanoi graphs which correspond to the variants of the
famous Tower of Hanoi problem with multiple pegs where moves of the discs are
restricted throughout the arcs of a movement digraph whose vertices represent
the pegs of the puzzle and an arc from vertex $p$ to vertex $q$ exists if and
only if moves from peg $p$ to peg $q$ are allowed. In this paper, we gave some
notes on how to construct the restricted Hanoi graphs as well as some
combinatorial results on the number of arcs in these graphs.
