Extremal $F$-index of a graph with $k$ cut edges

R. Amin, S.M.A. Nayeem

The so called forgotten index or $F$-index is defined as the sum of cubes of vertex degrees of a molecular graph. In this paper, we have obtained the upper and lower bounds of $F$-index for the graphs with $k$ cut edges and also we have characterized the extremal graphs.