On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
From MaRDI portal
Publication:2420418
Abstract: The General Randi'c index of a simple graph is defined as [ R_alpha(G)=sum_{v_{i}sim v_{j}} (delta_{i}delta_{j})^alpha, ] where denotes the degree of the vertex . Rodr'iguez-Vel'azquez and Tom'as-Andreu [MATCH Commun. Math. Comput. Chem. 74 (1) (2015) 145--160] obtained closed formulae for the Randi'c index of Sierpi'nski-type polymeric networks, where the base graph is a complete graph, a triangle-free regular graph or a bipartite semiregular graph. In the present article we obtain closed formulae for the general Randi'c index of Sierpi'nski-type polymeric networks, where the base graph is arbitrary.
Recommendations
Cites work
- 1-perfect codes in Sierpiński graphs
- A spectral approach to the Randić index
- A survey and classification of Sierpiński-type graphs
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Arboricity and Subgraph Listing Algorithms
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Hamming dimension of a graph-the case of Sierpiński graphs
- scientific article; zbMATH DE number 5005369 (Why is no real title available?)
- scientific article; zbMATH DE number 5251354 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- scientific article; zbMATH DE number 2239329 (Why is no real title available?)
- New results on variants of covering codes in Sierpiński graphs
- On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
- On general Randić indices
- On generalized Sierpiński graphs
- On history of the Randić index and emerging hostility toward chemical graph theory
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On some metric properties of the Sierpiński graphs S(n,k)
- On the Randi\'{c} index and conditional parameters of a graph
- On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
- On the roman domination number of generalized Sierpiński graphs
- Recent results in the theory of Randić index.
- The average eccentricity of Sierpiński graphs
- The Randić index and girth of triangle-free graphs.
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- Total coloring for generalized Sierpiński graphs
Cited in
(18)- Metric properties of generalized Sierpiński graphs over stars
- On some bounds of the topological indices of generalized Sierpiński and extended 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
- Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs
- The Graovac-Pisanski index of Sierpiński graphs
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
- On generalized Sierpiński graphs
- Recognizing generalized Sierpiński graphs
- Stolarsky-Puebla index
- Degree sequence of the generalized Sierpiński graph
- On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
- Resolvability and convexity properties in the Sierpiński product of graphs
- Topological properties of fractals via M-polynomial
- The Sierpiński domination number
- On the Sombor index of Sierpiński and Mycielskian graphs
- Metric dimensions of generalized Sierpiński graphs over squares
- The Sombor index and multiplicative Sombor index of some products of graphs
This page was built for publication: On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420418)