Results 21 to 30 of about 4,327,461 (194)

On the inverse mostar index problem for molecular graphs [PDF]

Transactions on Combinatorics
Mostar indices are recently proposed distance-based graph invariants, that already have been much investigated and found applications. In this paper, we investigate the inverse problem for Mostar indices of unicyclic and bicyclic molecular graphs.
Liju Alex, Ivan Gutman
doaj   +2 more sources

ON MOSTAR INDEX OF GRAPHS

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   +2 more sources

On cacti with large Mostar index

Filomat, 2019
The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges e = uv of G, where nu(e) and nv(e) are respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u.
Hayat, Fazal, Zhou, Bo
openaire   +4 more sources

Effectiveness of Individually Trained Oral Prophylaxis (iTOP) Education on Long-Term Oral Health in Medical and Dental Students: A Two-Year Prospective Cohort Study [PDF]

Dentistry Journal
Background/Objectives: Preventive oral health education plays a key role in preparing future healthcare professionals to promote and maintain good oral hygiene.
Zvonimir Lukac, Brigita Maric, Josip Kapetanovic, Mislav Mandic, Ivona Musa Leko, Andrija Petar Bosnjak   +5 more
doaj   +2 more sources

Maximum values of the edge Mostar index in tricyclic graphs

Filomat, 2023
For a graph G, the edge Mostar index of G is the sum of |mu (e|G)-mv (e|G)| over all edges e = uv of G, where mu (e|G) denotes the number of edges of G that have a smaller distance in G to u than to v, and analogously for mv (e|G). This paper mainly studies the problem of determining the graphs that maximize the edge Mostar index among tricyclic graphs.
Hayat, Fazal, Xu, Shou-Jun, Zhou, Bo
openaire   +3 more sources

On Mostar index of trees with parameters

Filomat, 2019
The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges uv of G, where nu and nv are respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u.
Hayat, Fazal, Zhou, Bo
openaire   +4 more sources

Detection of brain network abnormalities by graph invariants in Alzheimer’s disease using MRI images [PDF]

Scientific Reports
Alzheimer’s disease is a major cause of dementia in older adults. It involves gradual changes in brain function that result in cognitive decline, affecting memory, reasoning, and executive skills.
G. NallappaBhavithran, R. Selvakumar
doaj   +2 more sources

A lower bound on the Mostar index of tricyclic graphs

Filomat
For a graph G, the Mostar index of G is the sum of |nu-nv| over all edges e = uv of G, where nu denotes the number of vertices of G that have a smaller distance in G to u than to v, and analogously for nv. In this paper, we obtain a lower bound for the Mostar index on tricyclic graphs and identify those graphs that attain the lower bound.
Fazal Hayat, Shou-Jun Xu
openaire   +2 more sources

THE MOSTAR INDEX OF FULLERENES IN TERMS OF AUTOMORPHISM GROUP [PDF]

Facta Universitatis, Series: Mathematics and Informatics, 2020
Let $G$ be a connected graph. For an edge $e=uv\in E(G)$, suppose $n(u)$ and $n(v)$ are respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$.
Modjtaba Ghorbani, Shaghayegh Rahmani
openaire   +2 more sources

Computing the Mostar index in networks with applications to molecular graphs

, 2019
Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph $G$, the Mostar index is defined as $Mo(G) = \sum_{e=uv \in E(G)} |n_u(e) - n_v(e)|$, where for an edge $e=uv$ we denote by $n_u(e)$ the number of vertices of $G$ that are closer to $u$ than ...
Niko Tratnik
openaire   +4 more sources