On the first three minimum Mostar indices of tree-like phenylenes

From MaRDI portal
Publication:2103089

DOI10.1007/S12190-021-01677-9zbMATH Open1499.05135arXiv2103.04018OpenAlexW4200362691MaRDI QIDQ2103089FDOQ2103089

Lihua You, Zikai Tang, Hechao Liu, Hanlin Chen

Publication date: 13 December 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Abstract: Let G=(VG,EG) be a simple connected graph with its vertex set VG and edge set EG. The Mostar index Mo(G) was defined as Mo(G)=sumlimitse=uvinE(G)|nunv|, where nu (resp., nv) is the number of vertices whose distance to vertex u (resp., v) is smaller than the distance to vertex v (resp., u). 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.


Full work available at URL: https://arxiv.org/abs/2103.04018







Cites Work


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)