Photo by puskas_dominik from unsplash
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… Click to show full abstract
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 diļ¬erence between vertex-edge Szeged index and edge-vertex Szeged index of unicyclic graphs.
Keywords:
index;
szeged index;
vertex;
szeged indices;
indices graphs;
comparison szeged
Journal Title: Quaestiones Mathematicae
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Quaestiones Mathematicae
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!