New bounds on the hyper-Zagreb index for the simple connected graphs
From MaRDI portal
(Redirected from New bounds on the hyper-Zagreb index for the simple connected graphs)
Recommendations
Cites work
- A forgotten topological index
- A unified approach to the extremal trees for different indices
- An upper bound on the sum of squares of degrees in a graph
- Counting relations for general Zagreb indices
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 6756173 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- Maximizing the sum of the squares of the degrees of a graph
- New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs
- On general sum-connectivity index
- On reformulated Zagreb indices
- Some extremal graphs with respect to inverse degree
- Some properties of the reformulated Zagreb indices
- Sums of powers of the degrees of a graph
- The \(a\) and \((a, b)\)-analogs of Zagreb indices and coindices of graphs
- The third and hyper-Zagreb coindices of some graph operations
- The Zagreb coindices of graph operations
- Zagreb indices of graphs
Cited in
(6)- A short note on hyper Zagreb index
- scientific article; zbMATH DE number 6127697 (Why is no real title available?)
- scientific article; zbMATH DE number 7090169
- Degree-based indices of hypergraphs: definitions and first results
- On minimal trees with respect to hyper-Zagreb indices
- Zagreb-based indices of prime coprime graph for integers modulo power of primes
This page was built for publication: New bounds on the hyper-Zagreb index for the simple connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009977)