Results 71 to 80 of about 312 (96)

Cactus graphs with minimum edge revised Szeged index

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengmeng Liu, Shujing Wang 0003
openaire   +3 more sources

On the Revised Edge-Szeged Index of Graphs

2019
The 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

THE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS

2014
The 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

Tricyclic Graphs with Maximal Edge Revised Szeged Index

Advances in Applied Mathematics, 2020
openaire   +1 more source