Positive square-energy bounds for maximal planar and outerplanar graphs

A graph is maximal planar if it is planar and no edge can be added while preserving planarity, and maximal outerplanar if it is outerplanar and no edge can be added while preserving outerplanarity. Maximal planar and outerplanar square-energy conjecture.

If G is maximal planar of order n10, then s+(G)3n;if G is maximal outerplanar of order n8, then s+(G)2n.\begin{aligned} &\text{If $G$ is maximal planar of order $n\ge10$, then }s^+(G)\ge3n;\\ &\text{if $G$ is maximal outerplanar of order $n\ge8$, then }s^+(G)\ge2n. \end{aligned}

These bounds are proposed as more accessible refinements of previously discussed questions for maximal planar graphs. They are motivated by computational investigation and super-additivity of square energy; the source gives no general proof.

Sources & referencesView supporting material

Primary source

Saieed Akbari, Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada and Shengtong Zhang, “Refinement of a conjecture on positive square energy of graphs”, arXiv:2506.07264 (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.