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
A Study to Examine the Association of Health Related Behaviours and Body Mass Index among Young Adults at Selected Colleges in Kancheepuram District, Tamil Nadu, India
Sign Up to like & getrecommendations! Published in 2020 at "Medico-Legal Update"
DOI: 10.37506/mlu.v20i3.1371
Abstract: A observational study to examine the association of Health related behaviours and Body mass index among young adults at selected colleges in Kanchipuram District, Tamil Nadu, India’’. The objectives were to examine the lifestyle practices… read more here.
Keywords: mass index; young adults; index among; association ... See more keywords