On the difference of Mostar index and irregularity of graphs

DOI10.1007/s40840-020-00991-yzbMath1462.05080OpenAlexW3048044866MaRDI QIDQ2021671

Tomislav Došlić, Kexiang Xu, Fang Gao

Publication date: 27 April 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-020-00991-y

zbMATH Keywords

treeirregularitycactus graphedge contractionMostar indexedge subdivision

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (10)

Peripherality in networks: theory and applications ⋮ Graphs with maximum irregularity ⋮ Irregularity of graphs respecting degree bounds ⋮ Solving the Mostar index inverse problem ⋮ The Mostar index of Fibonacci and Lucas cubes ⋮ Mostar index: results and perspectives ⋮ Distance-unbalancedness of graphs ⋮ The Mostar and Wiener index of Alternate Lucas Cubes ⋮ Lower bounds on the irregularity of trees and unicyclic graphs ⋮ On the first three minimum Mostar indices of tree-like phenylenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the differences between Szeged and Wiener indices of graphs
• On a conjecture about the Szeged index
• On the discrepancy between two Zagreb indices
• On distance-balanced graphs
• Mostar index
• On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
• Extremal bicyclic graphs with respect to Mostar index
• Distance-balanced graphs: symmetry conditions
• Distance in graphs

This page was built for publication: On the difference of Mostar index and irregularity of graphs