Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index
详细信息    查看全文
文摘
Let G be a graph and d(v) denote the degree of a vertex v in G. Then the zeroth-order general Randić index of the graph G is defined as vV(G)d(v)α, where α is a pertinently chosen real number. We characterize, for any α, the connected (n,m)-graphs with minimum and maximum .

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700