Title of article
The augmented Zagreb index, vertex connectivity and matching number of graphs
Author/Authors
Ali، Akbar نويسنده National University of Computer and Emerging Sciences , , BHATTI، AKHLAQ AHMAD نويسنده Department of Sciences and Humanities, National University of Computer and Emerging Sciences, B?Block, Faisal Town, Lahore, Pakistan , , RAZA، ZAHID نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی 0 سال 2016
Pages
9
From page
417
To page
425
Abstract
Let $\Gamma_{n,\kappa}$ be the class of all graphs with $n\geq3$ vertices and $\kappa\geq2$ vertex connectivity. Denote by $\Upsilon_{n,\beta}$ the family of all connected graphs with $n\geq4$ vertices and matching number $\beta$ where $2\leq\beta\leq\lfloor\frac{n}{2}\rfloor$. In the classes of graphs $\Gamma_{n,\kappa}$ and $\Upsilon_{n,\beta}$, the elements having maximum augmented Zagreb index are determined.\\
Journal title
Bulletin of the Iranian Mathematical Society
Journal title
Bulletin of the Iranian Mathematical Society
Record number
2388602
Link To Document