Creative telescoping is an algorithmic technique central to computer algebra, employed for deriving recurrence relations and differential equations that characterise definite sums and integrals ...

Let G G be a simple connected graph. The first Zagreb index denoted by M 1(G) M 1 (G) is defined as M 1(G) = ∑u∈V d(u)2 M 1 (G) = ∑ u ∈ V d (u) 2. We present a lower bound for M 1(G) M 1 (G) in terms ...