Results 151 to 160 of about 4,075 (174)

On extremal cacti with respect to the Szeged index

Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shujing Wang
exaly   +2 more sources

The k-Szeged index of graphs

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanyuan Deng, Qiqi Xiao
openaire   +1 more source

On the difference between the Szeged index and the Wiener index of cacti

Discrete Applied Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Wang, Mengmeng Liu
openaire   +2 more sources

Szeged index of hollow hexagons

International Journal of Quantum Chemistry, 2023
AbstractThe 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

On the Szeged–Sombor Index of Graphs

Mathematical Notes
zbMATH 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

2017
Summary: 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., Modabernia, R., Namdari, M.   +2 more
openaire   +1 more source

The Szeged index of fasciagraphs

MATCH : communications in mathematical and in computer chemistry, 2003
Let 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, Juvan, Martin, Petkovšek, Marko, Vesel, Aleksander, Žerovnik, Janez   +4 more
openaire   +3 more sources

Szeged index of some nanotubes

Current Applied Physics, 2008
Abstract 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, B. Manoochehrian, A.R. Ashrafi   +2 more
openaire   +1 more source

An inequality between variable wiener index and variable szeged index

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katarína Hrináková, Martin Knor, Riste Skrekovski   +2 more
openaire   +2 more sources

Trees with minimum weighted Szeged index

The Art of Discrete and Applied Mathematics
Summary: 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, César Hernández-Cruz, Seyyed Aliasghar Hosseini   +2 more
openaire   +1 more source