Results 11 to 20 of about 4,075 (174)
Wiener index versus Szeged index in networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, M J Nadjafi-Arani
exaly +2 more sources
The vertex PI index and Szeged index of bridge graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour, Matthias Schork
exaly +2 more sources
Bicyclic graphs with maximal revised Szeged index
The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of ...
Xueliang Li
exaly +3 more sources
Tricyclic graphs with maximal revised Szeged index
14 pages.
Lily Chen, Xueliang Li
exaly +3 more sources
Five results on maximizing topological indices in graphs [PDF]
In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj +1 more source
Szeged-type indices of subdivision vertex-edge join (SVE-join)
In this article, we compute the vertex Padmakar-Ivan (PIv) index, vertex Szeged (Szv) index, edge Padmakar-Ivan (PIe) index, edge Szeged (Sze) index, weighted vertex Padmakar-Ivan (wPIv) index, and weighted vertex Szeged (wSzv) index of a graph product ...
Asghar Syed Sheraz +4 more
doaj +1 more source
ON PROPERTIES OF PRIME IDEAL GRAPHS OF COMMUTATIVE RINGS
The prime ideal graph of in a finite commutative ring with unity, denoted by , is a graph with elements of as its vertices and two elements in are adjacent if their product is in . In this paper, we explore some interesting properties of .
Rian Kurnia +5 more
doaj +1 more source
On minimum revised edge Szeged index of bicyclic graphs
The revised edge Szeged index [Formula: see text] of a graph G is defined as [Formula: see text] where [Formula: see text] and [Formula: see text] are, respectively, the number of edges of G lying closer to vertex u than to vertex v and the number of ...
Mengmeng Liu, Shengjin Ji
doaj +1 more source
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex-)PI index.
Martin Knor, Niko Tratnik
doaj +1 more source
Computing PI and Szeged indices of multiple phenylenes and cyclic hexagonal-square chain consisting of mutually isomorphic hexagonal chains [PDF]
PI and Szeged indices are two of the most important topological indices defined in chemistry. In this study, the PI and Szeged indices of linear [n]-phenylenes and a cyclic hexagonal-square chain consisting of n mutually isomorphic hexagonal chains were ...
Yousefi-Azari H. +3 more
doaj +3 more sources

