Abstract
The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu (e)nv (e) over all edges e = uv of G, where nu (e) is the number of vertices of G lying closer to u than v, and nv (e) is defined analogously. The aim of this paper is to present some relationship between Szeged index and some of its variants such as the edge-vertex Szeged index, the vertex-edge Szeged index and revised Szeged index. Moreover, we obtain lower and upper bounds on the difference between vertex-edge Szeged index and edge-vertex Szeged index of unicyclic graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
