Sign in
THE AUGMENTED ZAGREB INDEX, VERTEX CONNECTIVITY AND MATCHING NUMBER OF GRAPHS
Journal article   Peer reviewed

THE AUGMENTED ZAGREB INDEX, VERTEX CONNECTIVITY AND MATCHING NUMBER OF GRAPHS

A. Ali, A. A. Bhatti, Z. Raza and Akbar Ali
Bulletin of the Iranian Mathematical Society, Vol.42(2), pp.417-425
01/04/2016

Abstract

Mathematics Physical Sciences Science & Technology
Let Gamma(n,k) be the class of all graphs with n >= 3 vertices and k >= 2 vertex connectivity. Denote by Upsilon(n,beta) the family of all connected graphs with n >= 4 vertices and matching number beta where 2 <= beta <= left perpendicalar n/2 right perpendicalar In the classes of graphs Gamma(n,k) and Upsilon(n,beta), the elements having maximum augmented Zagreb index are determined.

Metrics

1 Record Views

Details