On the Vertex-Degree-Function Indices of Connected (n,m)-Graphs of Maximum Degree at Most Four

TL;DR

This paper establishes sharp bounds for vertex-degree-function indices of connected graphs with maximum degree at most four, characterizes extremal graphs, and unifies several existing indices as special cases.

Contribution

It provides new sharp bounds for degree-based indices of graphs with maximum degree four and identifies all extremal graphs, unifying multiple existing indices under a common framework.

Findings

Derived sharp bounds for $H_f(G)$ in terms of order and size.

Characterized all graphs achieving the bounds.

Unified bounds for various known degree indices.

Abstract

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$, where $d_v$ represents the degree of a vertex $v$ of $G$. This paper gives sharp bounds on the index $H_f(G)$ in terms of order and size of $G$ when $G$ is connected and has the maximum degree at most $4$. All the graphs achieving the derived bounds are also determined. Bounds involving several existing indices - including the general zeroth-order Randi\'c index and coindex, the general multiplicative first/second Zagreb index, the variable sum lodeg index, and the variable sum exdeg index - are deduced as the special cases of the obtained ones.