On the Randić index of corona product graphs (Q410644): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Ismael González Yero / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C76 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021216 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regular graphs | |||
Property / zbMATH Keywords: regular graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vertex degree sequence | |||
Property / zbMATH Keywords: vertex degree sequence / rank | |||
Normal rank |
Revision as of 19:28, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Randić index of corona product graphs |
scientific article |
Statements
On the Randić index of corona product graphs (English)
0 references
3 April 2012
0 references
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.
0 references
regular graphs
0 references
vertex degree sequence
0 references