Complete solution to a conjecture of Zhang-Liu-Zhou
Let dn;m = 2n+1 and En;m be the graph obtained from a path Pdn;m+1 = v0v1:::vdn;m by joining each vertex of Kn by joining each vertex of Kn. Zhang, Liu and Zhou [On the maximal eccentric connectivity indices of graphs, Appl. Math. J. Chinese Univ., in press] conjectured that if dn;m > 3, then En;...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2014-11-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/pdf_5986_740f215bc6659e95ccaa77c44e50e504.html |