Some useful lemmas on the edge Szeged index

arXiv1805.06578MaRDI QIDQ6301676FDOQ6301676

Authors: Shengjie He 

Publication date: 16 May 2018

Abstract: The edge Szeged index of a graph $G$ is defined as $S{z}_e(G)=sumlimit{s}_{uvinE(G)}{m}_u(uv|G)m_v(uv|G)$, where $m_u(uv|G)$ (resp., $m_v(uv|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. In this paper, we characterize the graph with minimum edge Szeged index among all the unicyclic graphs with given order and diameter.

This page was built for publication: Some useful lemmas on the edge Szeged index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301676)