Some diameter concepts in Sierpiński graphs

In any graph model representing a communication network, the diameter is an important parameter, as it signifies the longest route a message must traverse between two nodes. The notion of wide diameter, a generalization of the diameter, measures the maximum communication delay in a network, whereas the fault diameter evaluates its communication efficiency in the presence of faults. The impact of adding or removing links in a network communication can be studied by the concept of diameter variability. In this paper, we show that the wide diameter and fault diameter of Sierpiński graphs are identical and present some interesting results concerning their diameter variability.