Results 121 to 130 of about 2,917 (172)
Single-Fraction SBRT for Locally Advanced Pancreatic Cancer Using Total Intravenous Anaesthesia and Optical Surface Guidance: Technique and Preliminary Results. [PDF]
Cancers (Basel)Kaučić H +9 more
europepmc +1 more source
Restitution of Cervical Lordosis Following Anterior Cervical Discectomy and Fusion Using a Fixed Lordotic Angle Cage. [PDF]
CureusLakicevic G, Lakicevic S, Splavski B.
europepmc +1 more source
J. Gunčević, Mješovite ženidbe, Hrvatska Tiskara Mostar, Mostar, 1930.
Bogoslovska smotra, 1931 openaire +2 more sources
Small cell lung cancer (SCLC): At the door of targeted therapies.
Biomol BiomedTomić K, Vranić S.
europepmc +1 more source
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:
Related searches:
Mostar index: Results and perspectives
Applied Mathematics and Computation, 2021The 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
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$.
Johannes Pardey, Dieter Rautenbach
exaly +3 more sources
Journal of mathematical chemistry, 2018
We propose and investigate a new bond-additive structural invariant as a measure of peripherality in graphs. We first determine its extremal values and characterize extremal trees and unicyclic graphs. Then we show how it can be efficiently computed for large classes of chemically interesting graphs using a variant of the cut method introduced by Klav ...
Došlić, Tomislav +2 more
openaire +3 more sources
We propose and investigate a new bond-additive structural invariant as a measure of peripherality in graphs. We first determine its extremal values and characterize extremal trees and unicyclic graphs. Then we show how it can be efficiently computed for large classes of chemically interesting graphs using a variant of the cut method introduced by Klav ...
Došlić, Tomislav +2 more
openaire +3 more sources