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

On distances in generalized Sierpinski graphs

  • Dades identificatives

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

    Autor segons l'article: Estrada-Moreno, Alejandro; Rodriguez-Bazan, Erick D.; Rodriguez-Velazquez, Juan A.;
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Estrada Moreno, Alejandro / Rodríguez Velázquez, Juan Alberto
    Paraules clau: Sierpiński graphs Generalized sierpiński graphs Distances in graphs
    Resum: 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.
    Àrees temàtiques: Mathematics, applied Mathematics Matemática / probabilidade e estatística Engenharias iii Discrete mathematics and combinatorics Ciência da computação Applied mathematics Analysis
    Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
    Adreça de correu electrònic de l'autor: alejandro.estrada@urv.cat juanalberto.rodriguez@urv.cat
    Identificador de l'autor: 0000-0001-9767-2177 0000-0002-9082-7647
    Data d'alta del registre: 2024-09-07
    Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
    Enllaç font original: http://www.doiserbia.nb.rs/Article.aspx?ID=1452-86301800001E#.YjYculXMKJA
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Applicable Analysis And Discrete Mathematics. 12 (1): 49-69
    Referència 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 de l'article: 10.2298/AADM160802001E
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2018
    Tipus de publicació: Journal Publications
  • Paraules clau:

    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
  • Documents:

  • Cerca a google

    Search to google scholar