Results 31 to 40 of about 439 (151)
On cacti with large Mostar index
Filomat, 2019 The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges e = uv of G, where nu(e) and nv(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.
Hayat, Fazal, Zhou, Bo
openaire +3 more sources
On the Mostar index of trees and product graphs
Filomat, 2021 If G is a graph, and if for e = uv ? E(G) the number of vertices closer to u than to v is denoted by nu, then Mo(G) = ? uv?E(G) |nu-nv| is the Mostar index of G. In this paper, the Mostar index is studied on trees and graph products. Lower and upper bounds are given on the difference between the Mostar indices of a tree and a tree obtained ...
Yaser Alizadeh +2 more
openaire +2 more sources
Impulsivity and Empathy in Dating Violence among a Sample of College Females
Behavioral Sciences, 2020 The predictive factors of violence between married couples or adolescents are well-known. However, less is known about the factors relating to intimate violence among college students.
Arta Dodaj +2 more
doaj +1 more source
Acta Clinica Croatica, 2016 Since war activities, the previously mixed population of Mostar, Bosnia and Herzegovina, live in segregated parts of the town based on ethnicity. The aim of this study was to examine differences in health risks and health status between populations of ...
Ivan Vasilj +8 more
doaj +1 more source
Discrete MathematicsDošlić et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$. They conjectured that $Mo(G)\leq 0.\overline{148}n^3$ for every graph $G$ of order $n$.
Miklavič, Štefko +3 more
openaire +2 more sources
On Mostar index of trees with parameters
Filomat, 2019 The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges uv of G, where nu and nv 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.
Hayat, Fazal, Zhou, Bo
openaire +3 more sources
THE MOSTAR INDEX OF FULLERENES IN TERMS OF AUTOMORPHISM GROUP [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2020 Let $G$ be a connected graph. For an edge $e=uv\in E(G)$, suppose $n(u)$ and $n(v)$ 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$.
Modjtaba Ghorbani, Shaghayegh Rahmani
openaire +1 more source
Epipericardial Fat Necrosis in COVID‐19—A Case Report
Clinical Case Reports, Volume 14, Issue 3, March 2026.ABSTRACT Epipericardial fat necrosis (EFN) is a rare but benign cause of acute chest pain that can mimic life‐threatening conditions such as myocardial infarction, pulmonary embolism, and aortic dissection. This case highlights the importance of recognizing EFN to prevent unnecessary interventions.
Klaric Ivana +6 more
wiley +1 more source
Human health risk assessment of lead in nectarines [PDF]
Acta Agriculturae Serbica, 2018 The aim of the paper was to determine the level of soil contamination with lead and perform risk assessment by calculating the Hazard Quotient Index (HQI).
Šukalić Aida +4 more
doaj
Knee Surgery, Sports Traumatology, Arthroscopy, Volume 34, Issue 3, Page 1061-1080, March 2026.Abstract Purpose The purpose of this systematic review and multilevel meta‐analysis was to compare short‐term functional outcomes, pain relief, and complication rates between open and endoscopic gluteal tendon repair, expressed as functional improvement normalized to minimal clinically important difference (MCID) units.
Nikolai Ramadanov +8 more
wiley +1 more source