Zobrazeno 1 - 2
of 2
pro vyhledávání: '"5C12, 5C35"'
In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity index {\ta
Externí odkaz:
http://arxiv.org/abs/1711.07021
Publikováno v:
Asian-European Journal of Mathematics.
In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity index {\ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4769fa13e69c1ce24f26037716ab87b
https://doi.org/10.1142/s1793557123501383
https://doi.org/10.1142/s1793557123501383
