On the eccentric distance sum of unicyclic graphs with a given matching number

Shuchao Li, Yibing Song, Bing Wei

Let $G=(V_G,E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as ${\xi }^d(G)={\sum }_{v\in V_G}{\epsilon }_G(v)D_G(v),$ where ${\epsilon }_G(v)$ is the…