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