On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs

DOI10.1016/j.dam.2018.03.032zbMath1414.05085DBLPjournals/dam/Estrada-MorenoR19arXiv1510.07982OpenAlexW2964054228WikidataQ57974174 ScholiaQ57974174MaRDI QIDQ2420418

Juan Alberto Rodríguez-Velázquez, Alejandro Estrada-Moreno

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07982

zbMATH Keywords

topological indicesgeneral Randić indexgeneralized Sierpiński graphpolymeric networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07)

Related Items (11)

On generalized Sierpiński graphs ⋮ Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ Valency-based topological descriptors and structural property of the generalized Sierpiński networks ⋮ Degree sequence of the generalized Sierpiński graph ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Recognizing generalized Sierpiński graphs ⋮ Survey on the general Randić index: extremal results and bounds ⋮ Extremal trees for the general Randić index with a given domination number

Cites Work

• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• Hamming dimension of a graph-the case of Sierpiński graphs
• A spectral approach to the Randić index
• The average eccentricity of Sierpiński graphs
• On generalized Sierpiński graphs
• New results on variants of covering codes in Sierpiński graphs
• On the Randi\'{c} index and conditional parameters of a graph
• Arboricity and Subgraph Listing Algorithms
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 1-perfect codes in Sierpiński graphs
• On the roman domination number of generalized Sierpiński graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs