Results 101 to 110 of about 461 (137)

Upper gastrointestinal bleeding from primary aortoesophageal fistula in a patient with aneurism of the thoracoabdominal aorta: Case report and literature review. [PDF]

Clin Case Rep
Ristovska EC, Krstevski G, Andov M, Kolev A, Bundovski K, Rusiti K, Antovic S, Rankovic I, Kocev SB, Alcinova NH, Bogut A.   +10 more
europepmc   +1 more source

Expression of IMP3 and LIN28A RNA-Binding Proteins in Placentas of Patients with Pre-Eclampsia with and without Severe Features. [PDF]

Biomedicines
Barbaric M, Vukojevic K, Kolobaric A, Orlovic Vlaho M, Kresic T, Soljic V.   +5 more
europepmc   +1 more source

Mostar index and edge Mostar index of polymers [PDF]

Computational and Applied Mathematics, 2021
AbstractLet $$G=(V,E)$$ G = ( V , E ) be a graph and $$e=uv\in E$$ e = u
Nima Ghanbari, Saeid Alikhani, Alikhani Saeid   +2 more
exaly   +6 more sources

The Mostar Index of Fibonacci and Lucas Cubes [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2021
The Mostar index of a graph was defined by Došlić, Martinjak, Škrekovski, Tipurić Spužević and Zubac in the context of the study of the properties of chemical graphs. It measures how far a given graph is from being distance-balanced. In this paper, we determine the Mostar index of two well-known families of graphs: Fibonacci cubes and Lucas cubes.
Ömer Eğecioğlu, Elif Saygi
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Mostar index: Results and perspectives

Applied Mathematics and Computation, 2021
The Mostar index is a recently introduced bond-additive distance-based graph invariant that measures the degree of peripherality of particular edges and of the graph as a whole. It attracted considerable attention, both in the context of complex networks and in more classical applications of chemical graph theory, where it turned out to be useful as a ...
Akbar Ali, Tomislav Doslic
exaly   +2 more sources

Maximizing the Mostar index for bipartite graphs and split graphs

Discrete Optimization, 2023
Došlić et al.~defined the Mostar index of a graph $G$ as $\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$. Contributing to conjectures posed by Došlić et al., we show that the Mostar index of bipartite graphs of
Johannes Pardey, Dieter Rautenbach
exaly   +4 more sources