On maximum Zagreb indices of bipartite graphs with a given connectivity
From MaRDI portal
(Redirected from On maximum Zagreb indices of bipartite graphs with a given connectivity)
Cites work
- A unified approach to extremal multiplicative Zagreb indices for trees, unicyclic and bicyclic graphs
- A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
- Bipartite graphs with extreme values of the first general Zagreb indices
- Bipartite graphs with the maximal value of the second Zagreb index
- Bounds for Zagreb indices
- Chemical trees with extreme values of a few types of multiplicative Zagreb indices
- Chemical trees with extreme values of Zagreb indices and coindices
- Correction to ``On the distance Laplacian spectral radius of bipartite graphs
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Extremal bipartite graphs of given connectivity with respect to matching energy
- Extreme values of the sum of squares of degrees of bipartite graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Graph connectivity and Wiener index
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 7410264 (Why is no real title available?)
- On the distance Laplacian spectral radius of bipartite graphs
- On the distance spectral radius of bipartite graphs
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- On the monotonicity of topological indices and the connectivity of a graph
- On the sum of all distances in bipartite graphs
- On zeroth-order general Randić index of quasi-tree graphs containing cycles
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- Steiner Wiener index and connectivity of graphs
- The extremal values of some topological indices in bipartite graphs with a given matching number
- The Laplacian spectral radius of some graphs
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
This page was built for publication: On maximum Zagreb indices of bipartite graphs with a given connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650429)
