(n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions
From MaRDI portal
Publication:6182463
DOI10.46793/MATCH.91-1.197XOpenAlexW4387910499MaRDI QIDQ6182463
Publication date: 25 January 2024
Published in: Match - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.46793/match.91-1.197x
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- More on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- On the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\)
- Maximal value of the zeroth-order Randić index
- Unified extremal results of topological indices and spectral invariants of graphs
- Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
- On bond incident degree indices of (n,m) -graphs
- Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
- Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions
