Solving the Mostar index inverse problem

DOI10.1007/s10910-024-01581-0arXiv2312.13083OpenAlexW4392236811MaRDI QIDQ6203914

Kexiang Xu, Tomislav Došlić, Dragan Stevanović, Nino Bašić, Tomaž Pisanski, Ivan Damnjanović, Yaser Alizadeh

Publication date: 8 April 2024

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

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

zbMATH Keywords

inverse problemrealizability problemMostar indexinfinite realizability

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-balanced graphs
• Mostar index
• A formula with its applications on the difference of Zagreb indices of graphs
• Extremal bicyclic graphs with respect to Mostar index
• On the difference of Mostar index and irregularity of graphs
• On Mostar and edge Mostar indices of graphs
• Peripherality in networks: theory and applications
• Mostar index: results and perspectives
• Inverse problem for Zagreb indices
• All but 49 numbers are Wiener indices of trees
• Computing the Mostar index in networks with applications to molecular graphs
• Bounding the Mostar index
• Maximizing the Mostar index for bipartite graphs and split graphs

This page was built for publication: Solving the Mostar index inverse problem