The Median of Sierpinski Triangle Graphs
Combinatorics
2024-08-26 v1
Abstract
The median of a graph 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 are graphs formed by contracting all non-clique edges from the Sierpi\'{n}ski graphs of order ().
Cite
@article{arxiv.2408.12783,
title = {The Median of Sierpinski Triangle Graphs},
author = {Kannan Balakrishnan and Manoj Changat and M V. Dhanyamol and Andreas M. Hinz and Hrishik Koley and Divya Sindhu Lekha},
journal= {arXiv preprint arXiv:2408.12783},
year = {2024}
}