Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices
From MaRDI portal
(Redirected from Publication:608279)
Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
Recommendations
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Sharp bounds for the second Zagreb index of unicyclic graphs
- Sharp lower bounds for the Zagreb indices of unicyclic graphs
- A note on Zagreb indices
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
Cites work
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 2242494 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
- An upper bound on the sum of squares of degrees in a graph
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
- Further properties of Zagreb indices
- Graph theory with applications
- Maximizing the sum of the squares of the degrees of a graph
- Minimizer graphs for a class of extremal problems
- On acrylic and unicyclic conjugated graphs with maximum Zagreb indices
- On the connectivity index of trees
- On the extremal Zagreb indices of graphs with cut edges
- On the extremal connectivity index of trees with \(k\) pendant vertices
- 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\)
- Sharp bounds for the second Zagreb index of unicyclic graphs
- Similarity of molecular descriptors: the equivalence of Zagreb indices and walk counts
- Some estimations of Zagreb indices
- Sums of powers of the degrees of a graph
- The second Zagreb index of acyclic conjugated molecules
- Trees of extremal connectivity index
- Trees with maximal second Zagreb index and prescribed number of vertices of the given degree
- Upper bounds for Zagreb indices of connected graphs
Cited in
(12)- Sharp bounds for the second Zagreb index of unicyclic graphs
- Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Bicyclic graphs with the first three smallest and largest values of the first general Zagreb index
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- On the first and second Zagreb indices of quasi unicyclic graphs
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- Sharp bounds on Zagreb indices of cacti with \(k\) pendant vertices
- Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
- Graphs with fixed number of pendent vertices and minimal first Zagreb index
- On degree-based topological indices for bicyclic graphs
- Extremal Zagreb indices of graphs of order \(n\) with \(p\) pendent vertices
This page was built for publication: Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608279)
