Articles producció científica> Enginyeria Informàtica i Matemàtiques

On distances in generalized Sierpinski graphs

  • Datos identificativos

    Identificador: imarina:5133138
    Autores:
    Estrada-Moreno, AlejandroRodriguez-Bazan, Erick D.Rodriguez-Velazquez, Juan A.
    Resumen:
    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.
  • Otros:

    Autor según el artículo: Estrada-Moreno, Alejandro; Rodriguez-Bazan, Erick D.; Rodriguez-Velazquez, Juan A.;
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: Estrada Moreno, Alejandro / Rodríguez Velázquez, Juan Alberto
    Palabras clave: Sierpiński graphs Generalized sierpiński graphs Distances in graphs
    Resumen: 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.
    Áreas temáticas: Mathematics, applied Mathematics Matemática / probabilidade e estatística Engenharias iii Discrete mathematics and combinatorics Ciência da computação Applied mathematics Analysis
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: alejandro.estrada@urv.cat juanalberto.rodriguez@urv.cat
    Identificador del autor: 0000-0001-9767-2177 0000-0002-9082-7647
    Fecha de alta del registro: 2024-09-07
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: http://www.doiserbia.nb.rs/Article.aspx?ID=1452-86301800001E#.YjYculXMKJA
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Applicable Analysis And Discrete Mathematics. 12 (1): 49-69
    Referencia de l'ítem segons les normes 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
    DOI del artículo: 10.2298/AADM160802001E
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2018
    Tipo de publicación: Journal Publications
  • Palabras clave:

    Analysis,Applied Mathematics,Discrete Mathematics and Combinatorics,Mathematics,Mathematics, Applied
    Sierpiński graphs
    Generalized sierpiński graphs
    Distances in graphs
    Mathematics, applied
    Mathematics
    Matemática / probabilidade e estatística
    Engenharias iii
    Discrete mathematics and combinatorics
    Ciência da computação
    Applied mathematics
    Analysis
  • Documentos:

  • Cerca a google

    Search to google scholar