Distance-unbalancedness of graphs

DOI10.1016/J.AMC.2021.126233MaRDI QIDQ6352897arXivFDO

Authors Štefko Miklavič, Primož Šparl

Publication date 3 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.AMC.2021.126233

Mathematics Subject Classification ID

Distance in graphs (05C12) Chemical graph theory (05C92)

arXiv classification

math.CO

Abstract: In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced-ness, 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.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352897)