科研之友
微信
新浪微博
Facebook
分享链接
摘要
For a simple graph G with n vertices and m edges, the inequality M-1(G)/n %26lt;= M-2(G)/m; where M-1(G) and M-2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. Recently Vuki. cevic and Graovac [12], and Caporossi, Hansen and Vuki. cevic [3] proved that this inequality holds for trees and unicyclic graphs, respectively. Here, alternative and shorter proofs of these results are presented.
- 出版日期2012
- 单位INRIA
