Results 111 to 120 of about 461 (137)
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Advances in Mathematics: Scientific Journal, 2021
On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon
P. Kandan, S. Subramanian
openaire +1 more source
On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon
P. Kandan, S. Subramanian
openaire +1 more source
On the Difference of Mostar Index and Irregularity of Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2020For a connected graph the irregularity irr (G) are G, the Mostar index Mo(G) and defined as Mo(G) = uv∈E(G) |n u − n v | and irr (G) = uv∈E(G) |d u − d v |, respec- tively, where d u is the degree of the vertex u of G and n u denotes the number of vertices of G which are closer to u than to v for an edge uv.
Fang Gao, Kexiang Xu, Tomislav Doslic
exaly +3 more sources
Extremal bicyclic graphs with respect to Mostar index
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandra Tepeh
exaly +2 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
Mostar index and bounded maximum degree
Discrete OptimizationDoš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$.
Michael A Henning +2 more
exaly +4 more sources
Extremal phenylene chains with respect to the Mostar index
Discrete Mathematics, Algorithms and Applications, 2021For a connected graph [Formula: see text], the Mostar index is defined as [Formula: see text], where [Formula: see text] (respectively, [Formula: see text]) is the number of vertices of [Formula: see text] closer to [Formula: see text] (respectively, [Formula: see text]) than [Formula: see text] (respectively, [Formula: see text]).
Hanlin Chen +3 more
openaire +2 more sources
Extremal catacondensed benzenoids with respect to the Mostar index
Journal of Mathematical Chemistry, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kecai Deng, Shuchao Li, Deng Kecai
exaly +2 more sources
On the extremal values for the Mostar index of trees with given degree sequence
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kecai Deng, Shuchao Li
exaly +3 more sources
The Mostar index of Tribonacci cubes
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Niu
exaly +3 more sources