Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21286220211201On the variable sum exdeg index and cut edges of graphs2492571414210.22049/cco.2021.26865.1152ENAnsaKanwalKnowledge Unit of Science, University of Management and Technology,
Sialkot, PakistanAdnanAslamDepartment of Natural Sciences and Humanities,
University of Engineering and Technology, Lahore (RCET), PakistanZahidRazaDepartment of Mathematics, College of Sciences,
University of Sharjah, Sharjah, UAENaveedIqbalDepartment of Mathematics, Faculty of Science, University of Ha'il,
Ha'il, Saudi ArabiaBawfehKometaDepartment of Mathematics, Faculty of Science, University of Ha'il,
Ha'il, Saudi ArabiaJournal Article20200704The variable sum exdeg index of a graph $G$ is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number, $d_G(u)$ is the degree of a vertex $uin 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 $a>1$.http://comb-opt.azaruniv.ac.ir/article_14142_22abcc9eb4c4e3d46d7547d2a67702ad.pdf