2000 character limit reached
Distance-unbalancedness of graphs
Published 3 Nov 2020 in math.CO | (2011.01635v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
