Distance-unbalancedness of graphs

Štefko Miklavič and Primož Šparl

Applied Mathematics and Computation, 2021, vol. 405, issue C

Abstract: In this paper we propose and study a new structural invariant for graphs, called distance-unbalancedness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of well-known graphs. Distance-unbalancedness of trees is also studied. A few conjectures are stated and some open problems are proposed.

Keywords: Distance-unbalancedness; Distance-balanced graph; Mostar index (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321003234
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:405:y:2021:i:c:s0096300321003234

DOI: 10.1016/j.amc.2021.126233

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().