On maximum Zagreb indices of bipartite graphs with a given connectivity
From MaRDI portal
Publication:6650429
DOI10.1142/S1793557123500389MaRDI QIDQ6650429
Publication date: 9 December 2024
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Correction to ``On the distance Laplacian spectral radius of bipartite graphs
- On zeroth-order general Randić index of quasi-tree graphs containing cycles
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- On the distance spectral radius of bipartite graphs
- The extremal values of some topological indices in bipartite graphs with a given matching number
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- The Laplacian spectral radius of some graphs
- Extreme values of the sum of squares of degrees of bipartite graphs
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Extremal bipartite graphs of given connectivity with respect to matching energy
- On the monotonicity of topological indices and the connectivity of a graph
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Bipartite graphs with the maximal value of the second Zagreb index
- On the distance Laplacian spectral radius of bipartite graphs
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
- On the sum of all distances in bipartite graphs
- A unified approach to extremal multiplicative Zagreb indices for trees, unicyclic and bicyclic graphs
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Graph connectivity and Wiener index
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)