Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions

DOI10.46793/match.87-1.109TzbMath1498.92342MaRDI QIDQ5103775

Ioan Tomescu

Publication date: 8 September 2022

Published in: match Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (11)

Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function ⋮ Graphs with Minimum Vertex-Degree Function-Index for Convex Functions ⋮ On Bond Incident Degree Indices of Connected Graphs with Fixed Order and Number of Pendent Vertices ⋮ Resolution of Yan's Conjecture on Entropy of Graphs ⋮ Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix ⋮ General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index ⋮ Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees ⋮ Sombor Index of c-Cyclic Chemical Graphs ⋮ (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions ⋮ Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs ⋮ Degree-based function index for graphs with given diameter

This page was built for publication: Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions