Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2408.12783 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913477289836544 |
|---|---|
| author | Balakrishnan, Kannan Changat, Manoj Dhanyamol, M V. Hinz, Andreas M. Koley, Hrishik Lekha, Divya Sindhu |
| author_facet | Balakrishnan, Kannan Changat, Manoj Dhanyamol, M V. Hinz, Andreas M. Koley, Hrishik Lekha, Divya Sindhu |
| 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$). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_12783 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Median of Sierpinski Triangle Graphs Balakrishnan, Kannan Changat, Manoj Dhanyamol, M V. Hinz, Andreas M. Koley, Hrishik Lekha, Divya Sindhu Combinatorics 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$). |
| title | The Median of Sierpinski Triangle Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.12783 |