| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
On distances in generalized Sierpinski graphs | Alejandro Estrada-Moreno
; Erick D. Rodriguez-Bazan
; Juan A. Rodriguez-Velazquez
; | Date: |
2 Aug 2016 | Abstract: | In this paper we propose formulas for the distance between vertices of a
generalized Sierpi’{n}ski graph $S(G,t)$ in terms of the distance between
vertices of the base graph $G$. In particular, we deduce a recursive formula
for the distance between an arbitrary vertex and an extreme vertex of $S(G,t)$,
and we obtain a recursive formula for the distance between two arbitrary
vertices of $S(G,t)$ when the base graph is triangle-free. From these recursive
formulas, we provide algorithms to compute the distance between vertices of
$S(G,t)$. In addition, we give an explicit formula for the diameter and radius
of $S(G,t)$ when the base graph is a tree. | Source: | arXiv, 1608.0769 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |