Extremal Values For Ratios Of Distances In Trees

Stablo je povezan aciklički graf, tj. povezan graf koji ne sadrži cikluse. Brojni autori posvetili su se istraživanju prosječne udaljenosti u stablima. Udaljenost između vrhova u i v u povezanom grafu G definirana je kao duljina najkraćeg (u, v)− puta u G te ju označavamo s dG(u, v) ili d(u, v). Glavni cilj ovog rada je odrediti asimptotske vrijednosti omjera raznih udaljenosti u stablima.A tree is a connected acyclic graph, i.e. a connected graph that does not contain cycles. Numerous authors have dedicated themselves to research the average distance in trees. Distance between vertices u and v in connected graph G is defined as the length of the shortest (u, v)−path in G and is denoted by dG(u, v) or d(u, v). The main goal of this work is to determine the asymptotic values of ratios of various distances in the trees