Summary: Let \(G\) be a graph with vertex set \(V = (v_1, v_2, \dots, v_n)\). Let \(\delta(v_i)\) be the degree of the vertex \(v_i \in V\). If the vertices \(v_{i_1}, v_{i_2}, \dots, v_{i_{h+1}}\) form a path of length \(h \geq 1\) in the graph \(G\), then the \(h\)th order Randić index \(R_h\) of \(G\) is defined as the sum of the terms \(1 /\sqrt{\delta(v_{i_1}) \delta(v_{i_2}) \cdots \delta(v_{i_{h+1}})}\) over all paths of length \(h\) contained (as subgraphs) in \(G\). Lower and upper bounds for \(R_h\), in terms of the vertex degree sequence of its factors, are obtained for corona product graphs. Moreover, closed formulas are obtained when the factors are regular graphs.
- A spectral approach to the Randić index
- scientific article; zbMATH DE number 5005369 (Why is no real title available?)
- scientific article; zbMATH DE number 4074878 (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?)
- On general Randić indices
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On the Randi\'{c} index and conditional parameters of a graph
- Series expansion of the directed percolation probability
- The connectivity index of a weighted graph
This page was built for publication: On the Randić index of corona product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410644)
