Results 161 to 170 of about 4,075 (174)

On revised Szeged index of a class of unicyclic graphs

Discrete Mathematics, Algorithms and Applications, 2021
Computing 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, 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 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, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavzar, Shuchao Li, Huihui Zhang 0002   +2 more
openaire   +1 more source

On Edge Szeged Index of Bridge Graphs

2012
The edge Szeged index of graphs is new topological indices presented very recently, having applications in chemistry. In this paper, a formula for the edge Szeged index of bridge graphs is obtained and some other composite graphs are considered. Applying these formulas, the edge Szeged index of several graphs is computed.
Fuqin Zhan, Youfu Qiao
openaire   +1 more source

The Szeged Index and an Analogy with the Wiener Index

Journal of Chemical Information and Computer Sciences, 1995
Padmakar V. Khadikar, Narayan V. Deshpande, Prabhakar P. Kale, Andrey A. Dobrynin, Ivan Gutman, Gyula Dömötör   +5 more
openaire   +1 more source

A note on revised Szeged index of graph operations

2018
Summary: 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

2022
openaire   +1 more source

Szeged Index of Symmetric Graphs

Journal of Chemical Information and Computer Sciences, 1998
openaire   +1 more source

Total-Szeged Index of C<SUB>4</SUB>-Nanotubes, C<SUB>4</SUB>-Nanotori and Dendrimer Nanostars

Journal of Computational and Theoretical Nanoscience, 2013
Paul Manuel, Indra Rajasingh, Micheal Arockiaraj   +2 more
exaly  

Variants of the Szeged index in certain chemical nanosheets

Canadian Journal of Chemistry, 2016
Micheal Arockiaraj, Joseph Clement, Arul Jeya Shalini   +2 more
exaly