On the first three minimum Mostar indices of tree-like phenylenes
From MaRDI portal
Publication:2103089
Abstract: Let be a simple connected graph with its vertex set and edge set . The Mostar index was defined as , where (resp., ) is the number of vertices whose distance to vertex (resp., ) is smaller than the distance to vertex (resp., ). In this study, we determine the first three minimum Mostar indices of tree-like phenylenes and characterize all the tree-like phenylenes attaining these values. At last, we give some numerical examples and discussion.
Cites work
- scientific article; zbMATH DE number 5627526 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Computing the Mostar index in networks with applications to molecular graphs
- Extremal bicyclic graphs with respect to Mostar index
- Extremal catacondensed benzenoids with respect to the Mostar index
- Extremal phenylene chains with respect to detour indices
- Extremal phenylene chains with respect to the Mostar index
- Hexagonal chains with first three minimal Mostar indices
- Mostar index
- On Mostar index of trees with parameters
- On cacti with large Mostar index
- On edge Mostar index of graphs
- On the difference of Mostar index and irregularity of graphs
- On the extremal Mostar indices of hexagonal chains
- On the extremal values for the Mostar index of trees with given degree sequence
- The PI index of phenylenes
- The hexagonal chains with the first three maximal Mostar indices
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
Cited in
(3)
This page was built for publication: On the first three minimum Mostar indices of tree-like phenylenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103089)