Maximizing the Mostar index for bipartite graphs and split graphs

DOI10.1016/j.disopt.2023.100768zbMath1517.05040arXiv2210.03399MaRDI QIDQ6108918

Johannes Pardey, Štefko Miklavič, Dieter Rautenbach, Florian Werner

Publication date: 30 June 2023

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Mostar indexdistance unbalance

Mathematics Subject Classification ID

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)

Related Items (3)

Bounding the Mostar index ⋮ Irregularity of graphs respecting degree bounds ⋮ Solving the Mostar index inverse problem

Cites Work

• Extremal catacondensed benzenoids with respect to the Mostar index
• Mostar index
• Extremal bicyclic graphs with respect to Mostar index
• Mostar index and edge Mostar index of polymers
• On the extremal Mostar indices of trees with a given segment sequence
• Peripherality in networks: theory and applications
• The hexagonal chains with the first three maximal Mostar indices
• The Mostar index of Fibonacci and Lucas cubes
• Mostar index: results and perspectives
• On the extremal values for the Mostar index of trees with given degree sequence
• THE MOSTAR INDEX OF FULLERENES IN TERMS OF AUTOMORPHISM GROUP
• Extremal phenylene chains with respect to the Mostar index
• A Relation Between Wiener Index and Mostar Index for Daisy Cubes
• On cacti with large Mostar index
• On Mostar index of trees with parameters

This page was built for publication: Maximizing the Mostar index for bipartite graphs and split graphs