Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
From MaRDI portal
(Redirected from Publication:2009006)
Recommendations
- Difference of Zagreb indices and reduced second Zagreb index of cyclic graphs with cut edges
- scientific article; zbMATH DE number 7411417
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- On the reduced second Zagreb index of graphs
- Some results on the difference of the Zagreb indices of a graph
Cites work
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 6289139 (Why is no real title available?)
- A note on chemical trees with minimum Wiener polarity index
- Beyond the Zagreb indices
- Bounds for Zagreb indices
- Complete characterization of graphs for direct comparing Zagreb indices
- Difference of Zagreb indices and reduced second Zagreb index of cyclic graphs with cut edges
- Direct comparison of the variable Zagreb indices of cyclic graphs
- General multiplicative Zagreb indices of trees
- Graph theory
- On difference of Zagreb indices
- On extremal Zagreb indices of trees with given domination number
- On the constant difference of Zagreb indices
- On the discrepancy between two Zagreb indices
- On the extremal Zagreb indices of graphs with cut edges
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- On the generalized Wiener polarity index of trees with a given diameter
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- On the sum of squares of degrees and products of adjacent degrees
- Ordering chemical trees by Wiener polarity index
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Some results on the difference of the Zagreb indices of a graph
- Sum of powers of the degrees of graphs: extremal results and bounds
- The second Zagreb indices of graphs with given degree sequences
- Wiener polarity index and its generalization in trees
Cited in
(10)- Upper bounds for the reduced second zagreb index of graphs
- Some results on the difference of the Zagreb indices of a graph
- Sharp bounds on the symmetric division deg index of graphs and line graphs
- The connectivity and the modified second multiplicative Zagreb index of graphs
- Difference of Zagreb indices and reduced second Zagreb index of cyclic graphs with cut edges
- scientific article; zbMATH DE number 7411417 (Why is no real title available?)
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- On the reduced first Zagreb index of graphs
- Upper bounds for some graph invariants in terms of blocks and cut-vertices
- Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
This page was built for publication: Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009006)
