Results 1 to 10 of about 312 (96)
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
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 +4 more sources
Topological edge properties of C60+12n fullerenes [PDF]
Beilstein Journal of Nanotechnology, 2013 A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges of M, respectively. The molecular graph M is called a fullerene graph, if M is the molecular graph of a fullerene molecule.
A. Mottaghi, Ali R. Ashrafi
doaj +2 more sources
Bicyclic graphs with maximal edge revised Szeged index
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengmeng Liu, Lily Chen
openaire +4 more sources
UEG Week 2025 Moderated Posters [PDF]
United European Gastroenterol JUnited European Gastroenterology Journal, Volume 13, Issue S8, Page S189-S802, October 2025.
europepmc +2 more sources
Revised Szeged Index and Revised Edge Szeged Index of Certain Special Molecular Graphs [PDF]
International Journal of Applied Physics and Mathematics, 2014 In theoretical chemistry, the revised Szeged index and revised Szeged edge index were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this paper, by virtue of mathematical derivation, we determine the revised Szeged index and revised edge Szeged index of fan molecular graph, wheel molecular graph, gear fan ...
Yun Gao, Wei Gao, Li Liang
openaire +1 more source
The extremal unicyclic graphs with given diameter and minimum edge revised Szeged index
AIMS Mathematics, 2023 <abstract><p>Let $ H $ be a connected graph. The edge revised Szeged index of $ H $ is defined as $ Sz^{\ast}_{e}(H) = \sum\limits_{e = uv\in E_H}(m_{u}(e|H)+\frac{m_{0}(e|H)}{2})(m_{v}(e|H)+\frac{m_{0}(e|H)}{2}) $, where $ m_{u}(e|H) $ (resp., $ m_{v}(e|H) $) is the number of edges whose distance to vertex $ u $ (resp., $ v $) is smaller ...
Shengjie He, Qiaozhi Geng, Rong-Xia Hao
openaire +2 more sources
The extremal unicyclic graphs of the revised edge Szeged index with given diameter
, 2023 Let $G$ be a connected graph. The revised edge Szeged index of $G$ is defined as $Sz^{\ast}_{e}(G)=\sum\limits_{e=uv\in E(G)}(m_{u}(e|G)+\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$)
He, Shengjie +2 more
openaire +2 more sources
Studying the corona product of graphs under some graph invariants [PDF]
Transactions on Combinatorics, 2014 The corona product $Gcirc H$ of two graphs $G$ and $H$ is obtained by taking one copy of $G$ and $|V(G)|$ copies of $H$; and by joining each vertex of the $i$-th copy of $H$ to the $i$-th vertex of $G$, where $1 leq i leq |V(G)|$.
M. Tavakoli +2 more
doaj
On extremal cacti with respect to the edge revised Szeged index
, 2018 Let $G$ be a connected graph. The edge revised Szeged index of $G$ is defined as $Sz^{\ast}_{e}(G)=\sum\limits_{e=uv\in E(G)}(m_{u}(e|G)+\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$)
He, Shengjie, Hao, Rong-Xia, Li, Deming
openaire +2 more sources