Nikiforov's extremal p-energy conjecture for trees

About 2 years old · traced to

Let T=(V,E)T=(V,E) be a tree with ∣V∣=n|V|=n and ∣E∣=m|E|=m. Let SnS_n be the star on nn vertices, let PnP_n be the path on nn vertices, and let Ep(T)\mathcal{E}_p(T) denote the pp-energy of TT.

Nikiforov's extremal pp-energy conjecture. For 1≤p≤21\leq p\leq2,

Ep(Sn)≤Ep(T)≤Ep(Pn).\mathcal{E}_p(S_n)\leq\mathcal{E}_p(T)\leq\mathcal{E}_p(P_n).

For p>2p>2,

Ep(Pn)≤Ep(T)≤Ep(Sn).\mathcal{E}_p(P_n)\leq\mathcal{E}_p(T)\leq\mathcal{E}_p(S_n).

The first range has been proved, as has the upper bound in the second range. The lower bound for p>2p>2 is known for positive even integers, while the full remaining assertion is open.

References

Primary source

Quanyu Tang, Yinchen Liu and Wei Wang, “On the Positive and Negative p-Energies of Graphs under Edge Addition”, arXiv:2410.09830 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.