In the paper, the authors give a purely graphical proof of the following theorem due to A. Lubiw: Every power of a strongly chordal graph is again strongly chordal [Proc. 17th Ann. Symp. Theory Computing (1985)].