科研之友
微信
新浪微博
Facebook
分享链接
摘要
Given a (molecular) graph, the first multiplicative Zagreb index Pi(1) is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index Pi(2) is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G(n,k) having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G(n,k) are provided. We also provide these graphs with the largest and smallest Pi(1)(G) and Pi(2)(G) in G(n,k).
