Results 141 to 150 of about 4,205,626 (161)
Some of the next articles are maybe not open access.
Trees with minimum weighted Szeged index
The Art of Discrete and Applied MathematicsSummary: The weighted Szeged index is a recent extension of the well-known Szeged index. Trees are conjectured to achieve the minimum weighted Szeged index among all graphs with a given number of vertices. In this paper, we present new tools to analyze and characterize trees with minimum weighted Szeged index.
Pavol Hell +2 more
openaire +2 more sources
On revised Szeged index of a class of unicyclic graphs
Discrete Mathematics, Algorithms and Applications, 2021Computing topological indices of graphs is a fundamental and classical topic. Let [Formula: see text] be a connected graph. The revised Szeged index [Formula: see text] is defined as [Formula: see text], where [Formula: see text] (respectively, [Formula: see text]) is the number of vertices whose distance to vertex [Formula: see text] (respectively ...
openaire +3 more sources
On the difference between the (revised) Szeged index and the Wiener index of cacti
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavzar +2 more
openaire +2 more sources
On the Revised Edge-Szeged Index of Graphs
2019The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of edges of G lying closer to vertex v than to vertex u, and the number of edges ...
Liu, Hechao, You, Lihua, Tang, Zikai
openaire +1 more source
The Szeged Index and an Analogy with the Wiener Index
Journal of Chemical Information and Computer Sciences, 1995Padmakar V. Khadikar +5 more
openaire +2 more sources
A note on revised Szeged index of graph operations
2018Summary: Let \(G\) be a finite and simple graph with edge set \(E(G)\). The revised Szeged index is defined as \[ Sz^{\ast}(G)=\sum_{e=uv\in E(G)}(n_u(e| G)+\frac{n_{G}(e)}{2})(n_v(e| G)+\frac{n_{G}(e)}{2}), \] where \(n_u(e| G)\) denotes the number of vertices in \(G\) lying closer to \(u\) than to \(v\) and \(n_{G}(e)\) is the number of equidistant ...
openaire +1 more source
Calculating Szeged Index and Revised Szeged Index by Using Adjacency Matrix
2022openaire +1 more source
Szeged Index of Symmetric Graphs
Journal of Chemical Information and Computer Sciences, 1998openaire +2 more sources
Szeged Related Indices of TUAC6[p, q]
Journal of Discrete Mathematical Sciences and Cryptography, 2017Wei Gao, Mohammad Reza Farahani
exaly
Revised Szeged index and revised edge-szeged index of special chemical molecular structures
Journal of Interdisciplinary Mathematics, 2016Wei Gao, Weifan Wang
exaly