Results 91 to 100 of about 916 (106)

The Dimensions of the Aortic Valve Annulus Are Not Associated with Systolic Excursion of Its Plane in the Same Healthy Adults: Detailed Insights from the Three-Dimensional Speckle-Tracking Echocardiographic MAGYAR-Healthy Study. [PDF]

J Clin Med
Nemes A, Ambrus N, Lengyel C.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the difference between the (revised) Szeged index and the Wiener index of cacti

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Shuchao Li
exaly   +2 more sources

A lower bound of revised Szeged index of bicyclic graphs

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shengjin Ji, Jian-Liang Wu
exaly   +2 more sources

Cactus graphs with minimum edge revised Szeged index

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shujing Wang
exaly   +2 more sources

On the Revised Szeged Index of Unicyclic Graphs with Given Diameter

Bulletin of the Malaysian Mathematical Sciences Society, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kun Peng, Rongxia Hao, Aimei Yu
exaly   +2 more sources

Bounds for the Sum-Balaban index and (revised) Szeged index of regular graphs

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hui Lei 0002, Hua Yang
exaly   +2 more sources

On revised Szeged index of a class of unicyclic graphs

Discrete Mathematics, Algorithms and Applications, 2021
Computing topological indices of graphs is a fundamental and classical topic. Let [Formula: see text] be a connected graph. The revised Szeged index [Formula: see text] is defined as [Formula: see text], where [Formula: see text] (respectively, [Formula: see text]) is the number of vertices whose distance to vertex [Formula: see text] (respectively ...
openaire   +2 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

A note on revised Szeged index of graph operations

2018
Summary: 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

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