摘要
图G的广义Randic指标定义为Rα=Rα(G)=∑uv∈E(G)(d(u)d(v))^α,其中d(u)是G的顶点u的度,α是任意实数.本文确定了单圈共轭图的广义Randic指标R-1的严格下界,并刻划了达到最小R-1的极图,这类极图还是化学图.
The general Randic index Rα = R,α (G) of a graph is the sun, of the weights (d(u)d(v))^α of all edges uv of G, where d(u) denotes the degree of the vertex u and α is an arbitrary real number. In this paper, a sharp lower bound on the R-1 for conjugated tmicyclic graphs(i.e., unicyelic graphs with a perfect, matching) is established and tile corresponding extremal graphs are characterized. These graphs are also extremal over all the unicyclic conjugated chemical graphs.
出处
《数学研究》
CSCD
2009年第2期160-166,共7页
Journal of Mathematical Study
基金
The project supported by the Science and Technology Foundation of Education Department ofFujian(JA08266)
the Research Foundation of Ningde Teachers College(2008102)