Sharp upper bound on the Sombor index of bipartite graphs with a given diameter
From MaRDI portal
Publication:6578242
DOI10.1007/S12190-023-01955-8zbMATH Open1541.05034MaRDI QIDQ6578242
Author name not available (Why is that?)
Publication date: 25 July 2024
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal values of the Sombor index in unicyclic and bicyclic graphs
- On the spectral radius of bipartite graphs with given diameter
- On the extremal sombor index of trees with a given diameter
- On Sombor index of trees with fixed domination number
- Extremal problems on sombor indices of unicyclic graphs with a given diameter
- On relations between Sombor and other degree-based indices
- Sombor index of chemical graphs
- On Sombor index of trees
- On graphs with integer Sombor index
- The Minimum Sombor Index for Unicyclic Graphs with Fixed Diameter
- Ordering chemical graphs by Sombor indices and its applications
- Extremal values on the Sombor index of trees
- Spectral properties of p-Sombor matrices and beyond
- The statistical analysis for Sombor indices in a random polygonal chain networks
- Modified Sombor index of unicyclic graphs with a given diameter
This page was built for publication: Sharp upper bound on the Sombor index 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 Q6578242)
