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

From MaRDI portal
Publication:2103089




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.









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)