The Median of Sierpinski Triangle Graphs
Abstract
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\'nski triangle graphs. Sierpi\'nski triangle graphs, also known as Sierpi\'nski gasket graphs of order n are graphs formed by contracting all non-clique edges from the Sierpi\'nski graphs of order (n+1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.