Pages that link to "Item:Q5050726"
From MaRDI portal
The following pages link to Graphs with Minimum Vertex-Degree Function-Index for Convex Functions (Q5050726):
Displaying 8 items.
- Degree-based function index for graphs with given diameter (Q2700610) (← links)
- On Bond Incident Degree Indices of Connected Graphs with Fixed Order and Number of Pendent Vertices (Q5050737) (← links)
- How to Compute the M-Polynomial of (Chemical) Graphs (Q5050766) (← links)
- Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix (Q5051399) (← links)
- Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\) (Q6138363) (← links)
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index (Q6164656) (← links)
- Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees (Q6167506) (← links)
- (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions (Q6182463) (← links)
