Distance-unbalancedness of graphs

DOI10.1016/j.amc.2021.126233OpenAlexW3155568986MaRDI QIDQ2243233

Štefko Miklavič, Primož Šparl

Publication date: 11 November 2021

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

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

zbMATH Keywords

Mostar indexdistance-balanced graphdistance-unbalancedness

Mathematics Subject Classification ID

Graph theory (05Cxx)

Related Items (5)

Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges ⋮ Trinajstić Index ⋮ Peripherality in networks: theory and applications ⋮ Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones ⋮ On distance-balanced generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-balanced graphs
• On distance-balanced graphs
• Randić index and information
• Mostar index
• \(\ell\)-distance-balanced graphs
• On the difference of Mostar index and irregularity of graphs
• Maximal Wiener index for graphs with prescribed number of blocks
• Trees with the maximal value of Graovac-Pisanski index
• Relations between total irregularity and non-self-centrality of graphs
• On a novel eccentricity-based invariant of a graph
• On 2-distance-balanced graphs

This page was built for publication: Distance-unbalancedness of graphs