Results 111 to 120 of about 439 (151)
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
openaire +1 more source
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
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
Computation of Mostar index for some graph operations
International Journal of Quantum Chemistry, 2021AbstractVery recently, a novel bond‐additive topological descriptor named as the Mostar index has been proposed as a measure of peripherality in networks and graphs. In this article, we compute the Mostar index of generalized Hierarchical product, lexicographic product, Cartesian product, corona product, join, subdivision vertex‐edge join and Indu–Bala
Shehnaz Akhter +3 more
openaire +1 more source
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]).
Chen, Hanlin +3 more
openaire +2 more sources
The Mostar index of Tribonacci cubes
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Wang, Min Niu
openaire +2 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
openaire +2 more sources
On Edge Mostar Index of Graphs
2020The edge Mostar index 𝑀𝑜𝑒(𝐺) of a connected graph 𝐺 is defined as 𝑀𝑜𝑒(𝐺)=Σ𝑒=𝑢𝑣∈𝐸(𝐺) |𝑚𝑢(𝑒|𝐺)−𝑚𝑣(𝑒|𝐺)|, where 𝑚𝑢(𝑒|𝐺)and 𝑚𝑣(𝑒|𝐺) are, respectively, the number of edges of 𝐺 lying closer to vertex 𝑢 than to vertex 𝑣 and the number of edges of 𝐺 lying closer to vertex 𝑣 than to vertex 𝑢. In this paper, we determine the extremal values of edge Mostar index
Liu, Hechao +3 more
openaire +1 more source