Table of Contents: :: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Balakrishnan, Kannan, Changat, Manoj, Dhanyamol, M V., Hinz, Andreas M., Koley, Hrishik, Lekha, Divya Sindhu
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2408.12783
Tags:	Add Tag No Tags, Be the first to tag this record!

Table of Contents:

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ński triangle graphs. Sierpiński triangle graphs, also known as Sierpiński gasket graphs of order $n$ are graphs formed by contracting all non-clique edges from the Sierpiński graphs of order ($n+1$).