The matching energy of graphs with given edge connectivity

Shengjin Ji, Hongping Ma

Let G be a simple graph of order $n$ and ${\mu }_1,{\mu }_2,\dots ,{\mu }_n$ the roots of its matching polynomial. The matching energy of $G$ is defined as the sum ${\sum }_{i=1}^n|{\mu }_i|$. Let $K_{n-…