Results 131 to 140 of about 4,205,626 (161)
The Szeged and the Wiener index of graphs
Applied Mathematics Letters, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Sandi Klavžar
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the difference between the Szeged index and the Wiener index of cacti
Discrete Applied Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Wang, Mengmeng Liu
openaire +3 more sources
Szeged index of hollow hexagons
International Journal of Quantum Chemistry, 2023AbstractThe Szeged index of a connected graph () is a well known distance based topological index. A primitive coronoid system is a coronoid system formed by a single chain in a macro‐cyclic arrangement consisting of linearly and angularly annelated hexagons. The angular hexagons are called corners. A hollow hexagon is a primitive coronoid system with
Carolina Lopera, Roberto Cruz
openaire +1 more source
The vertex PI index and Szeged index of bridge graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour, Matthias Schork
exaly +2 more sources
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
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
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
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
On extremal cacti with respect to the Szeged index
Applied Mathematics and Computation, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 +3 more sources