Complete characterization of graphs for direct comparing Zagreb indices
From MaRDI portal
Publication:323061
DOI10.1016/j.dam.2016.07.008zbMath1346.05037OpenAlexW2490587861MaRDI QIDQ323061
Batmend Horoldagva, Tsend-Ayush Selenge, Kinkar Chandra Das
Publication date: 7 October 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.008
Related Items (15)
Computation on the difference of Zagreb indices of maximal planar graphs with diameter two ⋮ Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs ⋮ The exponential second Zagreb index of \((n, m)\)-graphs ⋮ On \(ve\)-degree and \(ev\)-degree of graphs ⋮ On the reduced second Zagreb index of graphs ⋮ On the extremal cacti of given parameters with respect to the difference of Zagreb indices ⋮ \((n, m)\)-graphs with maximum exponential second Zagreb index ⋮ Beyond the Zagreb indices ⋮ On Sombor index of trees ⋮ A formula with its applications on the difference of Zagreb indices of graphs ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ Directed Zagreb indices ⋮ On reduced second Zagreb index ⋮ Unnamed Item ⋮ Upper bounds for the reduced second zagreb index of graphs
Uses Software
Cites Work
- Comparing Zagreb indices for connected graphs
- On difference of Zagreb indices
- New upper bounds on Zagreb indices
- Maximizing the sum of the squares of the degrees of a graph
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Sharp lower bounds for the Zagreb indices of unicyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complete characterization of graphs for direct comparing Zagreb indices