Results 181 to 190 of about 28,977 (200)
Some of the next articles are maybe not open access.
On the Szeged–Sombor Index of Graphs
Mathematical NoteszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex, L., Das, K. C.
openaire +1 more source
Computing Szeged index of graphs on triples
2017Summary: Let \(G=(V,E)\) be a simple connected graph with vertex set \(V\) and edge set \(E\). The Szeged index of \(G\) is defined by \(S\mathcal z(G)=\sum_{e=uv\in E^nu}(e| G)n_v(e| G)\), where \(n_u(e| G)\) is the number of vertices of \(G\) closer to \(u\) than \(v\) and \(n_v(e| G)\) can be defined in a similar way.
Darafsheh, M. +2 more
openaire +1 more source
The Szeged index of fasciagraphs
MATCH : communications in mathematical and in computer chemistry, 2003Let G**n be a graph which is obtained from a path Pn by replacing each vertex by a fixed graph G and replacing each edge by a fixed set of edges joining the corresponding copies of G. A matrix approach to the computation of distance-based invariants which gives a general procedure to obtain closed-form expressions (depending on n) for such invariants ...
Graovac, Ante +4 more
openaire +3 more sources
Szeged index of some nanotubes
Current Applied Physics, 2008Abstract The Szeged index is one of the most important topological indices defined in chemistry. In this paper, the Szeged index of the hexagonal triangle graph T(n) and the zig-zag polyhex nanotube TUHC6[2p,q] are computed.
H. Yousefi-Azari +2 more
openaire +1 more source
An inequality between variable wiener index and variable szeged index
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katarína Hrináková +2 more
openaire +2 more sources
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 +1 more source
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 +2 more sources
The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time
Journal of Chemical Information and Computer Sciences, 1997A 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 vertex-weighted graphs. An analogous approach yields also a linear algorithm for computing the Szeged
Victor Chepoi, Sandi Klavzar
openaire +1 more source
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 +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 +1 more source