Abstract
The authors Miličević et al. introduced the reformulated Zagreb indices [1], which is a generalization of classical Zagreb indices of chemical graph theory. In this paper, we mainly consider the maximum and minimum for the first reformulated index of graphs with connectivity at most k. The corresponding extremal graphs are characterized.
Original language | English |
---|---|
Pages (from-to) | 75-83 |
Number of pages | 9 |
Journal | Filomat |
Volume | 25 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 2011 |
Keywords
- Connectivity
- Maximum and minimum
- The first reformulated Zagreb index