科研之友
微信
新浪微博
Facebook
分享链接
摘要
The atom-bond connectivity (ABC) index of a graph G is defined in mathematical chemistry as ABC(G) = Sigma(uv epsilon E(G)) root d(u) d(v)-2/d(u)d(v), where E(G) is the edge set of G and d(u) is the degree of vertex u in G. In this paper, we determine the unique graphs with the largest and the second largest ABC indices respectively in the class of unicyclic graphs on 2m vertices with perfect matchings.
