Distance-unbalancedness of graphs

Miklavič, Štefko (author), Šparl, Primož (author)

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

• Language: Slovenian
• Keywords: matematika
• Work type: Article
• Typology: 1.01 - Original Scientific Article
• Organization: PEF - Faculty of Education
• Publication version: Author Accepted Manuscript
• Publisher: New York: Elsevier
• Year: 2021
• Number of pages: 1-10
• Numbering: 405
• PID: 20.500.12556/RUL-128565
• ISSN: 1873-5649
• COBISS.SI-ID: 67279619
• Publication date in RUL: 16.08.2021

Secondary language

• Language: English
• Keywords: distance-unbalancedness