The augmented Zagreb index, vertex connectivity and matching number of graphs
From MaRDI portal
Publication:2412068
Recommendations
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Bounds on augmented Zagreb index of graphs
- Maximum augmented Zagreb index of graphs with given vertex bipartiteness
- Sharp upper bounds for augmented Zagreb index of graphs with fixed parameters
- Some new lower bounds for augmented Zagreb index
Cited in
(10)- Augmented Zagreb index of trees and unicyclic graphs with perfect matchings
- On \textit{EAZ} index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges
- Computing vertex-based eccentric topological descriptors of zero-divisor graph associated with commutative rings
- Extremal graphs with given parameters in respect of general ABS index
- On the maximal augmented Zagreb index of unicyclic graphs with given girth
- A note on the augmented Zagreb index of cacti with fixed number of vertices and cycles
- Extremal graphs with respect to generalized ABC index
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters
- Further inequalities between vertex-degree-based topological indices
- Maximal augmented Zagreb index of trees with given diameter
This page was built for publication: The augmented Zagreb index, vertex connectivity and matching number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412068)