Author, as appears in the article.: Estrada-Moreno, Alejandro; Rodriguez-Bazan, Erick D.; Rodriguez-Velazquez, Juan A.;
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Estrada Moreno, Alejandro / Rodríguez Velázquez, Juan Alberto
Keywords: Sierpiński graphs Generalized sierpiński graphs Distances in graphs
Abstract: In this paper we propose formulas for the distance between vertices of a generalized Sierpi nski 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.
Thematic Areas: Mathematics, applied Mathematics Matemática / probabilidade e estatística Engenharias iii Discrete mathematics and combinatorics Ciência da computação Applied mathematics Analysis
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: alejandro.estrada@urv.cat juanalberto.rodriguez@urv.cat
Author identifier: 0000-0001-9767-2177 0000-0002-9082-7647
Record's date: 2024-09-07
Papper version: info:eu-repo/semantics/publishedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Applicable Analysis And Discrete Mathematics. 12 (1): 49-69
APA: Estrada-Moreno, Alejandro; Rodriguez-Bazan, Erick D.; Rodriguez-Velazquez, Juan A.; (2018). On distances in generalized Sierpinski graphs. Applicable Analysis And Discrete Mathematics, 12(1), 49-69. DOI: 10.2298/AADM160802001E
Entity: Universitat Rovira i Virgili
Journal publication year: 2018
Publication Type: Journal Publications
Repositori URV