For every p ≥ 2 and every connected simple graph G on n vertices, the p-energy E_p(G) is at least E_p(P_n), with equality for p > 2 if and only if G is the path.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
The authors prove that for a unicyclic graph G on n vertices with odd cycle length k, s+(G) > n > s-(G) when k ≡ 3 mod 4 and s+(G) < n < s-(G) when k ≡ 1 mod 4.
Establishes path-minimality inequalities for adjacency p-energies, Laplacian-type spectral sums, and signless Laplacian energies of line graphs under stated conditions on p and graph class.
citing papers explorer
-
Path-Minimality of $p$-Energy for Connected Graphs
For every p ≥ 2 and every connected simple graph G on n vertices, the p-energy E_p(G) is at least E_p(P_n), with equality for p > 2 if and only if G is the path.
-
A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs
The authors prove that for a unicyclic graph G on n vertices with odd cycle length k, s+(G) > n > s-(G) when k ≡ 3 mod 4 and s+(G) < n < s-(G) when k ≡ 1 mod 4.
-
Path-Minimality for Positive $p$-Energies, Laplacian-Type Spectra, and Line Graphs
Establishes path-minimality inequalities for adjacency p-energies, Laplacian-type spectral sums, and signless Laplacian energies of line graphs under stated conditions on p and graph class.