Results 161 to 170 of about 4,327,461 (194)
Some of the next articles are maybe not open access.
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 ...
Ali, Akbar, Došlić, Tomislav
semanticscholar +4 more sources
The weighted Mostar index of cacti
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengmeng Liu, Qianqian Zhen
semanticscholar +4 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
semanticscholar +4 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
semanticscholar +4 more sources
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.
Gao, Fang +2 more
semanticscholar +5 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
semanticscholar +4 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
semanticscholar +4 more sources
The Mostar index of Tribonacci cubes
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Wang, Min Niu
openaire +3 more sources
On the extremal values for the Mostar index of trees with given degree sequence
Applied Mathematics and Computation, 2021For a given graph G, the Mostar index Mo(G) is the sum of absolute values of the differences between nu(e) and nv(e) over all edges e = u v of G, where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to u than to v and the ...
Kecai Deng, Shuchao Li
semanticscholar +3 more sources