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

arXiv2207.00353MaRDI QIDQ6403734FDOQ6403734

Authors: Abeer M. Albalahi, Igor Ž. Milovanović, Zahid Raza, Akbar Ali, Amjad E. Hamza 

Publication date: 1 July 2022

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 $vinV(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.

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07) Chemical graph theory (05C92)

This page was built for publication: On the Vertex-Degree-Function Indices of Connected (n,m)-Graphs of Maximum Degree at Most Four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6403734)