Computing the Mostar index in networks with applications to molecular graphs
From MaRDI portal
Publication:4988503
DOI10.22052/ijmc.2020.240316.1526zbMath1464.92320arXiv1904.04131MaRDI QIDQ4988503
Publication date: 17 May 2021
Full work available at URL: https://arxiv.org/abs/1904.04131
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Related Items (7)
Peripherality in networks: theory and applications ⋮ Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones ⋮ The cut method on hypergraphs for the Wiener index ⋮ Solving the Mostar index inverse problem ⋮ Mostar index: results and perspectives ⋮ On graphs preserving PI index upon edge removal ⋮ On the first three minimum Mostar indices of tree-like phenylenes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-based topological indices of the tree-like polyphenyl systems
- Extremal catacondensed benzenoids with respect to the Mostar index
- Triangulating a simple polygon in linear time
- Distances in benzenoid systems: Further developments
- Wiener index of hexagonal systems
- Mostar index
- Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\)
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- Extremal bicyclic graphs with respect to Mostar index
- The Graovac-Pisanski index of zig-zag tubulenes and the generalized cut method
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- On the extremal values for the Mostar index of trees with given degree sequence
- Fullerene patches I
- New methods for calculating the degree distance and the Gutman index
This page was built for publication: Computing the Mostar index in networks with applications to molecular graphs
