Results 1 to 10 of about 916 (106)
On minimum revised edge Szeged index of bicyclic graphs
AKCE International Journal of Graphs and Combinatorics, 2022 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 +4 more sources
The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +4 more sources
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Zhou, Rundan Xing
exaly +3 more sources
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milan Randic
exaly +3 more sources
Revised Szeged index and revised edge-szeged index of special chemical molecular structures
Journal of Interdisciplinary Mathematics, 2016 AbstractIn computational chemistry and graph theory, the revised edge-Szeged index and revised Szeged index were introduced to measure the properties of drugs and chemical compounds. As the extension of Szeged index and edge-Szeged index, the revised version Szeged index and edge-Szeged index is more available to test the characteristics of chemical ...
Wei Gao, Weifan Wang
exaly +3 more sources
Tricyclic graphs with maximal revised Szeged index
Discrete Applied Mathematics, 2014 14 pages.
Lily Chen, Xueliang Li
exaly +3 more sources
Bicyclic graphs with maximal revised Szeged index
Discrete Applied Mathematics, 2013 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
On extremal cacti with respect to the revised Szeged index
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shujing Wang
exaly +3 more sources
On the difference between the revised Szeged index and the Wiener index
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar
exaly +3 more sources
On the further relation between the (revised) Szeged index and the Wiener index of graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li
exaly +3 more sources