Lower bounds on the general first Zagreb index of graphs with low cyclomatic number
For a real number \(a\ne 0\), the general first Zagreb index is defined as \[M_1^a(G)=\sum\limits_{v\in V(G)} d_v^a.\] The results of \(M_1^a(G)\) for \(a>0\) have extensiverly been studied. In this paper, the authors prove several results for \(M_1^a(G)\) such that \(a<0\). Several sharp bounds on \(M_1^a(G)\) with \(a<0\) for trees, unicyclic graphs, and bicyclic graphs with given order and maximum degrees are proven. Extremal graphs attaining the bounds are also characterized. Other graphical indices whose degree functions are either convex or concave are also considered in this respect. The main tools authors employ to show their results are extremal set theory and tools from mathematical analysis.
- Sharp lower bounds for the Zagreb indices of unicyclic graphs
- Bicyclic graphs with the first three smallest and largest values of the first general Zagreb index
- Unicyclic graphs with the first three smallest and largest first general Zagreb index
- A lower bound for the first Zagreb index and its application
- Some inequalities for the first general Zagreb index of graphs and line graphs
- A forgotten topological index
- A formula with its applications on the difference of Zagreb indices of graphs
- A unified approach to the extremal trees for different indices
- An inequality for degree sequences
- An upper bound on the sum of squares of degrees in a graph
- Bicyclic graphs with the first three smallest and largest values of the first general Zagreb index
- Bounds for Zagreb indices
- Extremal augmented Zagreb index of trees with given numbers of vertices and leaves
- Extremal properties of Kirchhoff index and degree resistance distance of unicyclic graphs
- Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
- Extreme Wiener indices of trees with given number of vertices of maximum degree
- General sum-connectivity index of unicyclic graphs with given diameter
- scientific article; zbMATH DE number 7360668 (Why is no real title available?)
- Lanzhou index of trees with fixed maximum degree
- Lower bounds on the entire Zagreb indices of trees
- Lower bounds on the irregularity of trees and unicyclic graphs
- Maximizing the Zagreb indices of (n,m)-graphs
- On comparing Zagreb indices of graphs
- On the reduced second Zagreb index of graphs
- On Zagreb indices and coindices
- Some extremal graphs with respect to inverse degree
- Some properties of the first general Zagreb index
- Statistical analyses of a class of random pentagonal chain networks with respect to several topological properties
- The degree-product index of Narumi and Katayama
- The statistical analysis for Sombor indices in a random polygonal chain networks
- The sum of the squares of degrees: sharp asymptotics
- Trees with the first three smallest and largest generalized topological indices
- Unicyclic graphs with the first three smallest and largest first general Zagreb index
This page was built for publication: Lower bounds on the general first Zagreb index of graphs with low cyclomatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145808)
