摘要
设G=(V,E)是简单连通图,第二原子键连通指数是一种的新的原子键连通指数ABC2,即ABC2=ABC2(G)=∑uv∈E(G)(nu+nv-2/nunv)1/2,其中nu(nv)表示图中到边e=uv的顶点u(v)距离比到顶点v(u)距离小的顶点数.本文刻画了具有第一小、第二小与第一大、第二大第二原子键连通指数的树及具有最小第二原子键连通指数的单圈图.
Given a simple graph G = ( V,E), the second atom-bond connectivity index ABC2 of G is a new version of the atom-bond connectivity index as ABC2=ABC2(G)=∑uv∈E(G)(nu+nv-2/nunv)1/2, where nu denotes the number of vertices of G whose distances to vertex u are smaller than those to other vertex v of the edge e = uv, and nv is defined analogously. In this paper, the trees with the first, second minimum and the first, second maximum ABC2 are characterized and the unicyclic graphs with minimum ABC2 are characterized.
出处
《湖南师范大学自然科学学报》
CAS
北大核心
2015年第4期80-84,共5页
Journal of Natural Science of Hunan Normal University
基金
湖南省自然科学基金资助项目(12JJ6005)
湖南师范大学优秀青年基金资助项目(ET13101)
关键词
第二原子键连通指数
树
单圈图
the second atom-bond connectivity index (ABC2)
trees
unicyclic graphs