izpis_h1_title_alt

Distance-unbalancedness of graphs
ID Miklavič, Štefko (Author), ID Šparl, Primož (Author)

URLURL - Presentation file, Visit http://pefprints.pef.uni-lj.si/6785/ This link opens in a new window

Abstract
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 This link opens in a new window
ISSN:1873-5649
COBISS.SI-ID:67279619 This link opens in a new window
Publication date in RUL:16.08.2021
Views:490
Downloads:26
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Keywords:distance-unbalancedness

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back