Results 11 to 20 of about 4,327,461 (194)
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 +2 more
semanticscholar +8 more sources
Mostar index and edge Mostar index of polymers [PDF]
Computational and Applied Mathematics, 2021 AbstractLet $$G=(V,E)$$ G = ( V , E ) be a graph and $$e=uv\in E$$ e = u
Nima Ghanbari, Saeid Alikhani
semanticscholar +9 more sources
Maximizing the Mostar index for bipartite graphs and split graphs [PDF]
Discrete Optimization, 2023 Došlić et al.~defined the Mostar index of a graph $G$ as $\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$. Contributing to conjectures posed by Došlić et al., we show that the Mostar index of bipartite graphs of
Miklavič, Štefko +3 more
semanticscholar +6 more sources
The Mostar and Wiener index of Alternate Lucas Cubes [PDF]
Transactions on Combinatorics, 2023 The Wiener index and the Mostar index quantify two distance related properties of connected graphs: the Wiener index is the sum of the distances over all pairs of vertices and the Mostar index is a measure of how far the graph is from being distance ...
Omer Eğecioğlu +2 more
doaj +5 more sources
Disproof of a Conjecture on the Edge Mostar Index [PDF]
Utilitas Mathematica, 2023 For a connected graph \(G\), the edge Mostar index \(Mo_e(G)\) is defined as \(Mo_e(G)=\sum\limits_{e=uv \in E(G)}|m_u(e|G) - m_v(e|G)|\), where \(m_u(e|G)\) and \(m_v(e|G)\) are respectively, the number of edges of \(G\) lying closer to vertex \(u\) than to vertex \(v\) and the number of edges of \(G\) lying closer to vertex \(v\) than to vertex ...
Hayat, Fazal, Xu, Shou-Jun, Zhou, Bo
openaire +4 more sources
Solving the Mostar index inverse problem
Journal of Mathematical Chemistry, 2023 17 ...
Yaser Alizadeh +6 more
openaire +3 more sources
Mucoepidermoid Carcinoma of the Right Bronchus in a Six-Year-Old Girl: A Rare Pediatric Case Report. [PDF]
Case Rep PediatrPrimary lung neoplasms in children are uncommon, with a significant majority being metastatic. Among primary lung tumors, mucoepidermoid carcinoma (MEC) represents a rare entity, accounting for 0.1%–0.2% of cases. We present the case of a six‐year‐old girl who initially presented with right‐sided pneumonia and pleural effusion.
Kraljević D +5 more
europepmc +2 more sources
Some inequalities on the Mostar index
Creative Mathematics and Informatics, 2022 "Topological indices are the numerical descriptors of a molecular structure obtained via molecular graph G. They are used to predict physicochemical and bioactive properties of the molecules and molecular compounds. In this paper, the Mostar index is studied.
Özge Çolakoǧlu Havare
openaire +2 more sources
The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Mathematics, 2023 Let G be a connected graph; the edge Mostar index Moe(G) of G is defined as Moe(G)=∑e=uv∈E(G)|mu(e)−mv(e)|, where mu(e) and mv(e) denote the number of edges in G that are closer to vertex u than to vertex v and the number of edges that are closer to ...
Hui Wang, Mengmeng Liu
doaj +3 more sources
On the Mostar index of trees and product graphs
Filomat, 2021 If G is a graph, and if for e = uv ? E(G) the number of vertices closer to u than to v is denoted by nu, then Mo(G) = ? uv?E(G) |nu-nv| is the Mostar index of G. In this paper, the Mostar index is studied on trees and graph products. Lower and upper bounds are given on the difference between the Mostar indices of a tree and a tree obtained ...
Yaser Alizadeh +2 more
openaire +3 more sources