Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
From MaRDI portal
(Redirected from Publication:609972)
Recommendations
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- Upper bounds for Zagreb indices of connected graphs
- The Zagreb indices of bipartite graphs with more edges
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- New upper bounds on Zagreb indices
Cites work
- 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
- Bipartite graphs with extreme values of the first general Zagreb indices
- Extreme values of the sum of squares of degrees of bipartite graphs
- Further properties of Zagreb indices
- 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?)
- scientific article; zbMATH DE number 2239309 (Why is no real title available?)
- Maximizing the sum of the squares of the degrees of a graph
- Minimizer graphs for a class of extremal problems
- On the connectivity index of trees
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- On the spectral radius of bipartite graphs with given diameter
- 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
(21)- 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
- Bipartite graphs with the maximal value of the second Zagreb index
- On the spectral radius and energy of the weighted adjacency matrix of a graph
- Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
- Computing SS index of certain dendrimers
- On the Kirchhoff index of bipartite graphs with given diameters
- Zeroth-order general Randić index of cactus graphs
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- Comparing the Zagreb indices of the NEPS of graphs
- Sharp upper bounds for the F-index of bipartite graphs with a given diameter.
- The Zagreb indices of bipartite graphs with more edges
- Bipartite graphs with extreme values of the first general Zagreb indices
- Trees with the minimal second Zagreb index
- Extremal tetracyclic graphs with respect to the first and second Zagreb indices
- Further results on the reciprocal degree distance of graphs
- The first general Zagreb index of graphs and their line graphs
- On maximum Zagreb indices of bipartite graphs with a given connectivity
- The Zagreb indices of four operations on graphs
- On extremal Zagreb indices of trees with given domination number
This page was built for publication: Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609972)
