For p ≥ 2 the p-energy of any connected graph on n vertices is minimized by the path P_n, with equality only for the path when p > 2.
Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic,IEEE Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Path-Minimality of $p$-Energy for Connected Graphs
For p ≥ 2 the p-energy of any connected graph on n vertices is minimized by the path P_n, with equality only for the path when p > 2.