Minimum Szeged index among unicyclic graphs with perfect matchings
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00390-5
Abstract: Let G be a connected graph. The Szeged index of G is defined as $$Sz(G)=\sum \nolimits _{e=uv\in E(G)}n_{u}(e|G)n_{v}(e|G)$$Sz(G)=∑e=uv∈E(G)nu(e|G)nv(e|G), where $$n_{u}(e|G)$$nu(e|G) (resp., $$n_{v}(e|G)$$nv(e|G)) is the number of vertices whose distance to vertex u (resp., v) is… read more here.
Keywords: index among; unicyclic graphs; minimum szeged; among unicyclic ... See more keywords
Comparison between Szeged indices of graphs
Sign Up to like & getrecommendations! Published in 2019 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2019.1599077
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… read more here.
Keywords: index; szeged index; vertex; szeged indices ... See more keywords
Extremal Structure on Revised Edge-Szeged Index with Respect to Tricyclic Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14081646
Abstract: For a given graph G, Sze*(G)=∑e=uv∈E(G)mu(e)+m0(e)2mv(e)+m0(e)2 is the revised edge-Szeged index of G, where mu(e) and mv(e) are the number of edges of G lying closer to vertex u than to vertex v and the… read more here.
Keywords: tricyclic graphs; edge szeged; revised edge; extremal structure ... See more keywords