In this paper a novel ranking method which may be useful in sports like tennis, table tennis or American football, etc. is introduced and analyzed. In order to rank the players or teams, a time-dependent PageRank based method is applied on the directed and weighted graph representing game results in a sport competition. The method was examined on the results of the table tennis competition of e...

Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...

function f: G  , with this property that f(G1) = f(G2) if G1 and G2 are isomorphic. There are several vertex distance-based and degree-based indices which introduced to analyze the chemical properties of molecule graph. For instance: Wiener index, PI index, Szeged index, geometric-arithmetic index, atom-bond connectivity index and general sum connectivity index are introduced to test the perf...

The second geometric-arithmetic index GA2(G) of a graph G was introduced recently by Fath-Tabar et al. [2] and is defined to be ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] , where e = uv is one edge in G, and nu(e,G) denotes the number of vertices in G lying closer to u than to v. In this paper, we characterize the tree with the minimum GA2 index among the set of trees with given order and...

The Szeged index (Sz) is a recently proposed1q2 structural descriptor, based on the distances of the vertices of the molecular graph. In order to be able to study the properties of this novel topological index it would be advantageous to possess an easy method for its calculation. The calculation of Sz directly from its definition (see below) is quite cumbersome, especially in the case of large...

Let G= V E be a simple connected graph. The distance between two vertices of G is defined to be the length of the shortest path between the two vertices. There are topological indices assigned to G and based on the distance function which are invariant under the action of the automorphism group of G. Some important indices assigned to G are the Wiener, Szeged, and PI index which we will find th...