The leap Zagreb and Wiener polarity indices are computed from the information of second and third distances in a graph. Like many other topological indices defined in the literature, these indices are important for their applications in quantitative structure‐property relationship studies. In this paper, we compute these indices of a graph product known as subdivision vertex‐edge join of three graphs, which is also known as SVE‐join of graphs. We also compute the leap Zagreb coindices of these graphs.
The eccentric connectivity index ξc is a distance-based molecular structure descriptor that was recently used for mathematical modelling of biological activities of diverse nature. We prove that the broom has maximum ξc among trees with a fixed maximum vertex degree, and characterize such trees with minimum ξc. In addition, we propose a simple linear algorithm for calculating ξc of trees
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.