scientific article; zbMATH DE number 6704981
From MaRDI portal
Publication:2975719
Recommendations
- Trees of given order and independence number with minimal first Zagreb index
- Graphs with fixed number of pendent vertices and minimal first Zagreb index
- Extremum modified first Zagreb connection index of \(n\)-vertex trees with fixed number of pendent vertices
- Trees with maximal second Zagreb index and prescribed number of vertices of the given degree
- On the maximum and minimum Zagreb indices of trees with a given number of vertices of maximum degree
- Trees with the minimal second Zagreb index
- The minimum Sombor index of trees with given number of pendant vertices
- The minimal Merrifield-Simmons index of the trees with definite pendent vertices
- On the trees with given matching number and the modified first Zagreb connection index
- On the Modified First Zagreb Connection Index of Trees of a Fixed Order and Number of Branching Vertices
Cited in
(15)- Extremal values on Zagreb indices of trees with given distance k-domination number
- The Zagreb indices of graphs based on four new operations related to the lexicographic product
- Extremum modified first Zagreb connection index of \(n\)-vertex trees with fixed number of pendent vertices
- Minimizing degree-based topological indices for trees with given number of pendent vertices
- Note on minimizing degree-based topological indices of trees with given number of pendent vertices
- Trees of given order and independence number with minimal first Zagreb index
- On segments, vertices of degree two and the first Zagreb index of trees
- On the reduced second Zagreb index of trees
- On the Modified First Zagreb Connection Index of Trees of a Fixed Order and Number of Branching Vertices
- Extremal Zagreb indices of graphs of order n with p pendent vertices
- Graphs with fixed number of pendent vertices and minimal first Zagreb index
- Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number
- The Zagreb indices of four operations on graphs
- On the minimum vertex-degree-based topological indices of trees with given pendent vertices
- A complete solution for maximizing the general Sombor index of chemical trees with given number of pendant vertices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975719)