Results 81 to 87 of about 894 (87)
Some of the next articles are maybe not open access.
On the Revised Edge-Szeged Index of Graphs
2019The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of edges of G lying closer to vertex v than to vertex u, and the number of edges ...
Liu, Hechao, You, Lihua, Tang, Zikai
openaire +1 more source
A note on revised Szeged index of graph operations
2018Summary: 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
THE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS
2014The revised edge Szeged index of a connected graph G is defined as Sz∗ e (G) = X e=uv∈E(G) mu(e|G) + m0(e|G) 2 mv(e|G) + m0(e|G) 2 , where E(G) is the edge set of G, mu(e|G) is the number of edges closer to vertex u than to vertex v in G, mv(e|G) is the number of edges closer to vertex v than to vertex u in G, and m0(e|G) is the number of edges ...
DONG , Hui, ZHOU, bo
openaire +1 more source
Calculating Szeged Index and Revised Szeged Index by Using Adjacency Matrix
2022openaire +1 more source
Tricyclic Graphs with Maximal Edge Revised Szeged Index
Advances in Applied Mathematics, 2020openaire +1 more source
THE TOPOLOGICAL STUDY OF IPR FULLERENES BY SZEGED AND REVISED SZEGED INDICES
Journal of Theoretical and Computational Chemistry, 2012Ali Reza Ashrafi
exaly