In: The European Physical Journal B, 2015, vol. 88, no. 11, p. 1-9
|
In: Discrete Applied Mathematics, 2019, vol. 268, p. 102-111
The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex of G. The diameter of a graph G is the maximum eccentricity of a vertex in G. The eccentric connectivity index of a connected graph is the sum over all vertices of the product between eccentricity and degree. Given two integers n and D with D ≤ n−1, we characterize those graphs which have...
|
In: Results in Mathematics, 2013, vol. 64, no. 1-2, p. 175-184
|
In: Archiv der Mathematik, 2010, vol. 94, no. 5, p. 423-434
|
In: Instructional Science, 2006, vol. 34, no. 2, p. 97-129
|
In: Journal of Geometric Analysis, 2011, vol. 21, no. 3, p. 683-742
|
In: Journal of Group Theory, 2011, vol. 14, no. 3, p. 333-339
|
In: EPL - Europhysics Letters, 2011, vol. 94, no. 4, p. 48002
Ranking problem of web-based rating systems has attracted much attention. A good ranking algorithm should be robust against spammer attack. Here we proposed a correlation-based reputation algorithm to solve the ranking problem of such rating systems where user votes some objects with ratings. In this algorithm, the reputation of a user is iteratively determined by the correlation coefficient...
|
In: Archiv der Mathematik, 2010, vol. 94, no. 5, p. 423-434
Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F, it determines whether there exists a monomorphism of F that sends u to v. In this paper we show that the monomorphism problem is decidable and we provide an effective...
|