Results 11 to 20 of about 4,205,626 (161)
Computing the Szeged Index [PDF]
Croatica Chemica Acta, 1996 We give an explicit algorithm for computing the Szeged index of a graph which runs in O(mn) time, where n is the number of nodes and m is the number of ...
Žerovnik, Janez
core +4 more sources
On the relationship between variable Wiener index and variable Szeged index [PDF]
Applied Mathematics and Computation, 2022 We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the variable Wiener index and variable Szeged index for a connected, non-complete graph, one of which would imply the other.
Cambie, S. +4 more
core +6 more sources
On extremal graphs of weighted Szeged index [PDF]
CoRR, 2019 An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index (\(wSz(G)\)). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant.
Škrekovski, Riste +3 more
core +4 more sources
On Wiener index and variants of Szeged index of single-walled titania nanotubes TiO2(m,n) [PDF]
Journal of Interdisciplinary Mathematics, 2016 Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. There are certain types of topological indices such as degree based topological indices, distance based topological indices and ...
Hafi, Sabeel-e, Imran, Muhammad
core +2 more sources
The Szeged Index and Padmakar-Ivan Index on the Zero-Divisor Graph of a Commutative Ring
Contemporary Mathematics and Applications (ConMathA)The zero-divisor graph of a commutative ring is a graph where the vertices represent the zero-divisors of the ring, and two distinct vertices are connected if their product equals zero.
Jinan Ambar +2 more
doaj +2 more sources
The Edge Version of the Szeged Index [PDF]
Croatica Chemica Acta, 2008 The Szeged index is a molecular structure descriptor equal to the sum of products nu(e đ G) ⋅ nn(e | G) over all edges e = (uv) of the molecular graph G, where nu(e | G) is the number of vertices whose distance to vertex u is smaller than the distance ...
Ashrafi, Ali Reza, Gutman, Ivan
core +4 more sources
The Wiener index and the Szeged index of benzenoid systems in linear time
Journal of Chemical Information and Computer Sciences, 1997 A linear time algorithm is presented which, for a given benzenoid system G, computes the Wiener index of G. The algorithm is based on an isometric embedding of G into the Cartesian product of three trees, combined with the notion of the Wiener index of ...
Victor Chepoi
core +3 more sources
Bounds on Szeged and PI Indexes in terms of Second Zagreb Index [PDF]
, 2012 In this short note, we studied the vertex version and the edge version of the Szeged index and the PI index and obtained bounds for these indices in terms of the Second Zagreb index.
Ranjini P.S. +2 more
core +1 more source
A Novel Version of the Edge-Szeged Index [PDF]
, 2011 A novel version of the edge-Szeged index is proposed in parallel to the revised (vertex) Szeged index, and some properties, especially lower and upper bounds are established for this molecular descriptor.
Zhou, Bo, Dong, Hui, Trinajstić, Nenad
core +1 more source
Szeged Indices of Bicyclic Graphs with Applications as Molecular Descriptor [PDF]
, 2023 Molecular descriptors are mathematical representations of molecular properties, generated through numerous algorithms. These numerical values are used to quantitatively represent the physical and chemical attributes of molecules. In the field of chemical
Babai, Azam +2 more
core +1 more source