Permanental Energy of Graphs

Abstract

For a simple graph $G$ with adjacency matrix $A(G)$, let $\pi (G,x):=\mathrm{per}(xI-A(G))$ be its permanental polynomial with roots ${\mu }_1,\dots ,{\mu }_n\in \mathbb{C}$, and define the permanental energy $E_{\mathrm{per}}(G):={\sum }_{i=1}^n|{\mu }_i|$. We prove a sharp universal lower bound: for every $m$-edge graph $G$, $E_{\mathrm{per}}(G)\ge 2\sqrt{m}$, with equality if and only if $G$ is a star together with isolated vertices. We also prove the general upper bound $E_{\mathrm{per}}(G)\le n\rho (G)$, where $\rho (G)$ is the spectral radius, and we study $E_{\mathrm{per}}(G)$ on several graph families.