Sign in
Back
On the variable sum exdeg index and cut edges of graphs
Journal article   Peer reviewed

On the variable sum exdeg index and cut edges of graphs

Ansa Kanwal, Adnan Aslam, Zahid Raza, Naveed Iqbal and Bawfeh K. Kometa
Communications in combinatorics and optimization, Vol.6(2), pp.249-257
01/12/2021
DOI: https://doi.org/10.22049/CCO.2021.26865.1152

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
The variable sum exdeg index of a graph G is defined as SEIa(G) = Sigma(u is an element of V (G)) d(G)(u)a(dG(u)), where a not equal 1 is a positive real number, d(G)(u) is the degree of a vertex u is an element of V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every alpha > 1.

Metrics

1 Record Views

Details