Results 1 to 10 of about 4,327,461 (194)
On Zagreb coindices and Mostar index of $$TiO_2$$ T i O 2 nanotubes [PDF]
Scientific Reports, 2023 Topological indices are valuable tools in predicting properties of chemical compounds. This study focuses on degree-based topological indices, which have shown strong correlations with various physico-chemical properties such as boiling points and strain
Muhammad Imran +4 more
doaj +6 more sources
Mostar index of graphs associated to groups
Main Group Metal Chemistry, 2022 A bond-additive connectivity index, named as the Mostar index, is used to measure the amount of peripheral edges of a simple connected graph, where a peripheral edge in a graph is an edge whose one end vertex has more number of vertices closer as ...
Rehman Masood Ur +4 more
doaj +5 more sources
Mostar Index of Cycle-Related Structures [PDF]
Journal of Chemistry, 2022 A topological index is a numerical quantity associated with the molecular structure of a chemical compound. This number remains fixed with respect to the symmetry of a molecular graph.
Fatima Asif +3 more
doaj +4 more sources
A relation between Wiener index and Mostar index for daisy cubes [PDF]
Discrete Mathematics Letters, 2022 Daisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cubes include some previously well known families of graphs like Fibonacci cubes and Lucas cubes. Moreover they appear in chemical graph theory. Two distance invariants, Wiener and Mostar indices, have been introduced in the context of the mathematical chemistry.
Michel Mollard
doaj +6 more sources
Mostar index and bounded maximum degree [PDF]
Discrete Optimization, 2023 Doš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$.
Henning, Michael A. +3 more
semanticscholar +5 more sources
Bounding the Mostar index [PDF]
Discrete Mathematics, 2022 Doš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$.
Miklavič, Štefko +3 more
semanticscholar +5 more sources
Mostar Index of Neural Networks and Applications
IEEE Access, 2023 Neural networks are mathematical models that use learning algorithms inspired by the brain to store information. These networks have been extensively used to operate cognitive functions, robustness, fault tolerance, flexibility, collective computation ...
Fatima Asif +4 more
doaj +3 more sources
On the Extremal Weighted Mostar Index of Bicyclic Graphs
AxiomsLet G be a simple connected graph with edge set E(G) and vertex set V(G). The weighted Mostar index of a graph G is defined as w+Mo(G)=∑e=uv∈E(G)(dG(u)+dG(v))|nu(e)−nv(e)|, where nu(e) denotes the number of vertices closer to u than to v for an edge uv ...
Yuwei He, Mengmeng Liu
doaj +3 more sources
The Second Maximum Mostar Index of Unicyclic Graphs With Given Diameter
Journal of MathematicsTopological invariants are key tools for studying the physicochemical and thermodynamic properties of chemical compounds. Recently, a new bond-additive distance-based graph invariant called the Mostar index has been developed.
Muhammad Amer Qureshi +4 more
doaj +3 more sources
Retracted: Mostar Index of Cycle-Related Structures
Journal of ChemistryJournal of Chemistry
doaj +3 more sources