The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpi\'{ n}ski triangle graphs. Sierpi\'{ n}ski triangle graphs, also known as Sierpi\'{ n}ski gasket graphs of order $n$ are graphs formed by contracting all non-clique edges from the Sierpi\'{ n}ski graphs of order ($n+1$).

Categories: math.CO

The Median of Sierpinski Triangle Graphs