加载中…
The General Randi'c index of a simple graph is defined as 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本