Skip to main content
PLOS One logoLink to PLOS One
. 2012 Apr 4;7(4):e33699. doi: 10.1371/journal.pone.0033699

Bounds and Inequalities Relating h-Index, g-Index, e-Index and Generalized Impact Factor: An Improvement over Existing Models

Ash Mohammad Abbas 1,*
Editor: Neil R Smalheiser2
PMCID: PMC3319552  PMID: 22496760

Abstract

In this paper, we describe some bounds and inequalities relating Inline graphic-index, Inline graphic-index, Inline graphic-index, and generalized impact factor. We derive the bounds and inequalities relating these indexing parameters from their basic definitions and without assuming any continuous model to be followed by any of them. We verify the theorems using citation data for five Price Medalists. We observe that the lower bound for Inline graphic-index given by Theorem 2, Inline graphic, comes out to be more accurate as compared to Schubert-Glanzel relation Inline graphic for a proportionality constant of Inline graphic, where Inline graphic is the number of citations and Inline graphic is the number of papers referenced. Also, the values of Inline graphic-index obtained using Theorem 2 outperform those obtained using Egghe-Liang-Rousseau power law model for the given citation data of Price Medalists. Further, we computed the values of upper bound on Inline graphic-index given by Theorem 3, Inline graphic, where Inline graphic denotes the value of Inline graphic-index. We observe that the upper bound on Inline graphic-index given by Theorem 3 is reasonably tight for the given citation record of Price Medalists.

Introduction

A lot of research is carried out by people working in different areas. Sometimes, one needs to evaluate the quality of the research produced by individual authors or groups of authors. The quality of research produced by authors is, generally, evaluated in terms a ranking parameter which is, generally, based on the number of citations received by the papers produced by the authors. There are many types of ranking parameters presented in the literature for evaluating the quality of research such as Inline graphic-index [1], Inline graphic-index [2], Inline graphic-index [3], and impact factor [4]. The impact factor in the long term becomes the average number of citations per paper. This long term impact factor is termed as the generalized impact factor.

While one has computed an index for evaluating the quality of research, one would like to get an indication about the other types of indices. To have such an indication, one needs to know how an index is related to other indices. The relationships among Inline graphic-index, Inline graphic-index, and Inline graphic-index are described in [5]. However, in [5], the indices are assumed to follow a continuous distribution. A relation between Inline graphic-index and impact factor is described in [6] using a power law model called the Lotka's model.

In this paper, we describe the bounds for the Inline graphic-index and Inline graphic-index in terms of the indices and the generalized impact factor. We derive these bounds from the very basic definitions of the indices and the generalized impact factor without assuming any model or any continuous distribution to be followed by any of these indices. We verify the theorems for citation records of five Price Medalists. Also, we compare the values of Inline graphic-index with those obtained using Schubert-Glanzel formula and Egghe-Liang-Rousseau's power law model. Further, we discuss the tightness of the upper bound on Inline graphic-index for Price-Medalists.

In what follows, we present an analysis of the indices and the generalized impact factor.

Analysis

In this section, we wish to analyze the relationships among the indices and the generalized impact factor. To do so, we first present an overview of the indices and the generalized impact factor, and then we shall analyze the relationships among them.

Overview of Indices and Impact Factor

In this subsection, we briefly define the generalized impact factor and different types of indices.

The Inline graphic-Index

Suppose the papers are arranged in descending order of the number of citations. Let Inline graphic be the number of citations of a paper numbered Inline graphic. The Inline graphic-index [1], when papers are arranged in descending number of their citations, can be defined as follows.

graphic file with name pone.0033699.e031.jpg (1)

By definition, Inline graphic-index is the largest number, Inline graphic, such that the papers arranged in their decreasing order of citations have at least Inline graphic number of citations.

The Inline graphic-Index

According to the definition of Inline graphic-index, if the papers are arranged in the descending order of their number of citations, Inline graphic is the largest number such that the summation of the number of citations is at least Inline graphic. In other words, when papers are arranged in descending order of their citations, Inline graphic-index can be defined as follows.

graphic file with name pone.0033699.e040.jpg (2)

Note that Inline graphic-index is the largest number Inline graphic such that Inline graphic.

The Inline graphic-Index

The Inline graphic-index is defined in [3] to serve as a complement for the Inline graphic-index. The definition of Inline graphic-index is as follows.

graphic file with name pone.0033699.e048.jpg (3)

Alternatively, (3) can be written as follows.

graphic file with name pone.0033699.e049.jpg (4)

Remark: In the definitions of Inline graphic-index (as given by (1)) and that of Inline graphic-index (as given by (2)), we have intentionally ignored the time Inline graphic at which we are considering their values. This is done to keep their definitions simple, and defining so there is no loss of generality as far as the discussion in this work is concerned. For precise definitions of the indices incorporating the time, one is referred to [7]. The same is true for the Inline graphic-index. Secondly, while defining the indices and the impact factor, we assume that the number of papers, Inline graphic, and the numbers of citations received by ith paper, Inline graphic. This is also true for the theorems proved in this paper.

Generalized Impact Factor

Let Inline graphic be the number of citations of the paper numbered Inline graphic, and let Inline graphic be the number of papers. The generalized impact factor is defined as follows.

graphic file with name pone.0033699.e059.jpg (5)

Note that the generalized impact factor is simply called impact factor in [6]. We have added the prefix “generalized” to differentiate it from the impact factor that uses a time window constraint. Actually, the impact factor given by (5) (and also that given in [6]) denotes the average number of citations received per paper.

Analysis of Relationships

In this subsection, we describe how indices and generalized impact factor are related to one another.

Impact Factor, Inline graphic-Index and Inline graphic-Index

We state the following theorem that relates these parameters.

Theorem 1 Let Inline graphic be the number of papers and let Inline graphic be the numbers of citations received by ith paper. The Inline graphic -index, Inline graphic -index and impact factor are related by the following inequality.

graphic file with name pone.0033699.e066.jpg (6)

Proof. Using (5), the total number of citations can be written as follows.

graphic file with name pone.0033699.e067.jpg (7)

The citations appearing in the L.H.S. of (7) can be broken into two parts, one from Inline graphic to Inline graphic and the other from Inline graphic to Inline graphic, as given below.

graphic file with name pone.0033699.e072.jpg (8)

Using (4) and (8), we have,

graphic file with name pone.0033699.e073.jpg (9)

Now, we have,

graphic file with name pone.0033699.e074.jpg (10)

Therefore, we have,

graphic file with name pone.0033699.e075.jpg (11)

Using (9) and (11), we have,

graphic file with name pone.0033699.e076.jpg (12)

In other words, we have,

graphic file with name pone.0033699.e077.jpg (13)

Since Inline graphic is a whole number, therefore, we can write,

graphic file with name pone.0033699.e079.jpg

In other words, we can say that

graphic file with name pone.0033699.e080.jpg (14)

where, Inline graphic denotes the lower bound. For definitions of different types of bounds, we refer the readers to [8].

The Inline graphic-Index, Inline graphic-Index, and Inline graphic-Index

We state the following theorem that provides an inequality relating these indices.

Theorem 2 The Inline graphic -index, Inline graphic -index, and Inline graphic -index are related by the following inequality.

graphic file with name pone.0033699.e088.jpg (15)

Proof. Let the the papers are arranged in the descending order of their citations. From the definition of Inline graphic-index, as given in (2), we have,

graphic file with name pone.0033699.e090.jpg (16)

At Inline graphic, we have,

graphic file with name pone.0033699.e092.jpg (17)

Breaking the number of citations in the L.H.S. of (17) into parts, we have,

graphic file with name pone.0033699.e093.jpg (18)

Using (4) and (18), we have,

graphic file with name pone.0033699.e094.jpg (19)

In other words,

graphic file with name pone.0033699.e095.jpg (20)

Now, we have,

graphic file with name pone.0033699.e096.jpg (21)

Therefore, we have,

graphic file with name pone.0033699.e097.jpg (22)

Using (20) and (22), we have,

graphic file with name pone.0033699.e098.jpg (23)

Or,

graphic file with name pone.0033699.e099.jpg (24)

Rearranging (24), we have,

graphic file with name pone.0033699.e100.jpg (25)

Since all these indices, Inline graphic, Inline graphic, and Inline graphic are integers, therefore, (25) can be written as follows.

graphic file with name pone.0033699.e104.jpg

In other words, Theorem 2 provides a lower bound for Inline graphic-index in terms of the Inline graphic-index and the Inline graphic-index.

graphic file with name pone.0033699.e108.jpg (26)

We have the following lemma that provides a bound for the Inline graphic-index.

Lemma 1. An upper bound for Inline graphic -index is as follows.

graphic file with name pone.0033699.e111.jpg (27)

Proof. From (20), we have,

graphic file with name pone.0033699.e112.jpg

In (21), if we put Inline graphic at the R.H.S. for Inline graphic, Inline graphic, we get,

graphic file with name pone.0033699.e116.jpg (28)

Therefore, from (20), we have,

graphic file with name pone.0033699.e117.jpg (29)

Or,

graphic file with name pone.0033699.e118.jpg (30)

Or,

graphic file with name pone.0033699.e119.jpg (31)

This gives us,

graphic file with name pone.0033699.e120.jpg (32)

Again, all these indices are whole numbers, therefore, we can write,

graphic file with name pone.0033699.e121.jpg (33)

Alternatively,

graphic file with name pone.0033699.e122.jpg

We now prove another theorem that provides an upper bound for the Inline graphic-index in terms of Inline graphic-index and Inline graphic-index.

Theorem 3. An upper bound for Inline graphic -index in terms of Inline graphic -index and Inline graphic -index is as follows.

graphic file with name pone.0033699.e129.jpg (34)

Proof. Using (24), we have,

graphic file with name pone.0033699.e130.jpg (35)

This resembles to the quadratic equation Inline graphic, whose roots are as follows.

graphic file with name pone.0033699.e132.jpg (36)

Here, we have, Inline graphic, Inline graphic, Inline graphic, therefore, the only root for Inline graphic-index is,

graphic file with name pone.0033699.e137.jpg (37)

Now, we know that Inline graphic. In other words, we have,

graphic file with name pone.0033699.e139.jpg (38)

This implies that

graphic file with name pone.0033699.e140.jpg (39)

Using (37) and (39), we have,

graphic file with name pone.0033699.e141.jpg (40)

In other words, Inline graphic.

The Inline graphic-Index, Inline graphic-Index, and Impact Factor

We state the following theorem that relates these parameters.

Theorem 4. The generalized impact factor, Inline graphic -index, and Inline graphic -index are related as per the following inequality.

graphic file with name pone.0033699.e147.jpg (41)

Proof. From (5), we have,

graphic file with name pone.0033699.e148.jpg (42)

Breaking the number of citations in the L.H.S. of (42), we have,

graphic file with name pone.0033699.e149.jpg (43)

Now, we have,

graphic file with name pone.0033699.e150.jpg (44)

Therefore, we have,

graphic file with name pone.0033699.e151.jpg (45)

Using (43) and (44), we have,

graphic file with name pone.0033699.e152.jpg (46)

Or,

graphic file with name pone.0033699.e153.jpg

In other words, Theorem 4 states an upper bound for the generalized impact factor which is as follows.

graphic file with name pone.0033699.e154.jpg (47)

Utility of Bounds

We wish to point out that lower and upper bounds are very common in the area of Computer Science and Engineering. They are useful when either one cannot find exact expressions or it is difficult to derive the exact expressions. Using the bounds, one can say that the parameter lies above it (for a lower bound) or below it (for an upper bound). To the best of our knowledge, the exact relationships among the Inline graphic-index, Inline graphic-index, Inline graphic-index, and impact factor have not been described by any researcher till date. In the absence of such exact expressions, we suggest to use the lower and upper bounds, and it forms the motivation behind the derivation of bounds and inequalities presented in this paper. In our view, one can realize where the value of an indexing parameter lies given another set of parameter(s) without going through the whole citation database (of an author, a journal, an institution, a country or a region).

Existing Relationship Models

In this subsection, we briefly describe the existing models that relate some of the indices.

Schubert-Glanzel Formula

Let Inline graphic be the number of papers referenced and Inline graphic be the number of citations. According to Schubert-Glanzel model [9], the Inline graphic index is given by the following expression.

graphic file with name pone.0033699.e161.jpg (48)

where, Inline graphic is a proportionality constant. Another form of Schubert-Glanzel formula is,

graphic file with name pone.0033699.e163.jpg (49)

which is equivalent to that given by (48), however, (49) is in terms of the generalized impact factor.

The major drawback of Schubert-Glanzel formula is that it does not say anything about the value of the proportionality constant. In [10], the proportionality constant Inline graphic is assumed to be Inline graphic for journals and Inline graphic for other sources. In the absence of a specific value of the proportionality constant, we assume it to be equal to Inline graphic.

Egghe-Liang-Rousseau Model

A relationship between Inline graphic-index and generalized impact factor, Inline graphic, is presented by Egghe, Liang and Rousseau in [6], which is based on power law model and is as follows.

graphic file with name pone.0033699.e170.jpg (50)

Since Inline graphic-index is an integer, therefore, it is better to consider the ceiling of the R.H.S. of (50). In [6], it has been argued that when Inline graphic tends to Inline graphic, Inline graphic tends to Inline graphic.

In what follows, we verify the theorems and lemma proved in the previous section and compare them with the existing models.

Results and Discussion

In this section, we first verify our theorems using citation data for a set of scientists, for example, a set of five Price Medalists, and then compare them with the existing models. We collected the citation data for the given set of Price Medalists using scHolar index [11], which is based on Google Scholar. The numbers of citations of each referenced paper of Price Medalists are given in Medalist S1, S2, S3, S4, and S5.

Table 1 shows the number of citations (Inline graphic), the number of papers referenced (Inline graphic), Inline graphic-index, Inline graphic-index, and generalized impact factor (Inline graphic) for Price Medalists as per the citation data given in Medalist S1, S2, S3, S4, and S5. The values of Inline graphic-index, Inline graphic-index, and generalized impact factor shown in Table 1 are the actual values. In what follows, we verify the theorems for Price Medalists.

Table 1. The number of citations (Inline graphic), number of papers referenced (Inline graphic), Inline graphic-index, Inline graphic-index, and generalized impact factor (Inline graphic) for a set of five Price Medalists.

Price Medalists Inline graphic Inline graphic Inline graphic -Index Inline graphic -Index Inline graphic
Medalist S1 12674 520 45 101 24.37
Medalist S2 4861 180 38 62 27.01
Medalist S3 2701 110 30 48 24.55
Medalist S4 3556 176 27 54 20.20
Medalist S5 2785 130 26 48 21.42

Verification of Theorems

Table 2 shows a verification of Theorems for Price Medalists. The first row of the table shows the statements of each theorem and lemma. The symbol Inline graphic under the bound shows that the given theorem is verified. For example, consider Medalist S1 for whom Inline graphic, and therefore, Inline graphic. Theorem 1 gives Inline graphic, and the value of Inline graphic-index for Medalist S1 is Inline graphic. Since Inline graphic, therefore, Theorem 1 is verified. Theorem 2 gives Inline graphic, which is less than Inline graphic, therefore, Theorem 2 also is verified. Lemma 1 gives Inline graphic, and the value of Inline graphic-index for Medalist S1 is Inline graphic. Since Inline graphic is less than Inline graphic, therefore, Lemma 1 is verified. Theorem 3 gives Inline graphic, and since Inline graphic is less than Inline graphic therefore, Theorem 3 is verified. For verification of Theorem 4, we have, Inline graphic, and Inline graphic. Therefore, Inline graphic. Theorem 4 gives Inline graphic, and since Inline graphic for Medalist S1 is Inline graphic, which is smaller than Inline graphic, therefore, Theorem 4 is verified. Similarly, we can verify the theorems and lemma proved in this paper for other Price Medalists. The supplement data in terms of the values of intermediate parameters needed to verify the theorems and lemma is shown in Table 3.

Table 2. Verification of theorems for the given set of Price Medalists.

Price Theorem 1 Theorem 2 Lemma 1 Theorem 3 Theorem 4
Medalists Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S1 Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S2 Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S3 Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S4 Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S5 Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic Inline graphic

Table 3. The supplemental data in terms of intermediate parameters for the given set of Price Medalists.

Price Medalists Inline graphic Inline graphic Inline graphic Inline graphic
Medalist S1 8567 6542 1521 10088
Medalist S2 3085 1641 740 3825
Medalist S3 1956 1056 409 2365
Medalist S4 2381 1652 524 2905
Medalist S5 1855 1179 453 2308

Tightness of Bounds

Note that there are two lower bounds for Inline graphic-index, the one given by Theorem 1 and the other given by Theorem 2. Using Table 2, we see that the lower bound on Inline graphic-index given by Theorem 2 is closer to the actual values as compared to that given by Theorem 1. Similarly, there are two upper bounds for Inline graphic-index, the one given by Lemma 1 and the other given by Theorem 3. We observe from Table 2 that the upper bound on Inline graphic-index given by Theorem 3 is closer to the actual values of Inline graphic-index as compared to those given by Lemma 1. In other words, the bounds given by Theorem 2 and Theorem 3 are more tight as compared to those given by Theorem 1 and Lemma 1, respectively.

Table 4 shows the actual values of Inline graphic-index and the values of Inline graphic-index obtained using Theorem 3. Also, we computed the errors in the values given by Theorem 3 as compared to the actual values of Inline graphic-index for Price Medalists. We observe that the upper bound on the Inline graphic-index given by Theorem 3 is reasonably tight.

Table 4. Errors in the Inline graphic-index using Theorem 3 for the given set of Price Medalists.

Price Medalists Inline graphic -index Inline graphic -index (Theorem 3)
Value Error(%)
Medalist S1 101 126 24.75
Medalist S2 62 79 27.41
Medalist S3 48 63 31.25
Medalist S4 54 68 25.92
Medalist S5 48 61 27.08

Improvements over Schubert-Glanzel and Egghe-Liang-Rousseau Models

We computed the Inline graphic-index using Theorem 2. Also, we computed the values of Inline graphic-index for Price Medalists using Schubert-Glanzel formula given by (48) and using Egghe-Liang-Roussea's power law model given by (50). Note that the values of Inline graphic-index using any of these three models are approximate values. To study closeness of these approximate values to the exact values, we computed the percentage errors in the approximate values of Inline graphic-index with respect to the exact values, which are shown in Table 5. We observe that the percentage error in case of the values obtained using Theorem 2 is significantly less as compared to those obtained using either Schubert-Glanzel formula or Egghe-Liang-Rousseau power law model. For example, for Medalist S1, the exact value of Inline graphic-index is Inline graphic, the lower bound given by Theorem 2 is Inline graphic. The values of Inline graphic-index obtained using Schubert-Glanzel formula is Inline graphic and that obtained using Egghe-Liang-Rousseau's power law model is Inline graphic. The error using Theorem 2 is Inline graphic and the error in the value obtained using Schubert-Glanzel formula is Inline graphic. The error in the value of Inline graphic-index using Egghe-Liang-Rousseau's model is Inline graphic. Similarly, one can see from Table 5 that Theorem 2 provides a significant improvement over both Schubert-Glanzel formula and Egghe-Liang-Roussea's power law model.

Table 5. Errors in the Inline graphic-index using Theorem 2, Schubert-Glanzel model, and Egghe-Liang-Rousseau's power law model [6] for the given set of Price Medalists.

Price Medalists Inline graphic -Index Lower Bound Schubert-Glanzel Egghe et al
Value Error(%) Value Error(%) Value Error(%)
Medalist S1 45 36 20.00 68 51.11 100 122.22
Medalist S2 38 35 7.89 51 34.21 64 68.42
Medalist S3 30 26 13.33 41 36.66 47 56.66
Medalist S4 27 23 14.81 42 51.85 53 96.30
Medalist S5 26 23 11.54 40 53.85 47 80.77

Conclusion

Finding the relationships among indexing parameters for determining the quality of research is a challenging task. In this paper, we described some inequalities relating Inline graphic-index, Inline graphic-index, Inline graphic-index, and generalized impact factor. We derived the inequalities from the very basic definitions of these indexing parameters and without assuming any continuous model to be followed by any of them. However, the relationships in the form of bounds and inequalities among the indices are not trivial, and to the best of our knowledge, we are the first ones to present such kinds of relationships.

We verified the theorems and lemma presented in this paper for citation records of Price Medalists. We observed that the lower bound on Inline graphic-index given by Theorem 2 is more tight as compared to that given by Theorem 1. The upper bound on Inline graphic-index given by Theorem 3 is more tight as compared to that given by Lemma 1.

We compared the values of Inline graphic-index obtained using Theorem 2 with the values of Inline graphic-index obtained using either Schubert-Glanzel formula or Egghe-Liang-Rousseau model. We observed that the values of Inline graphic-index obtained using Theorem 2 are significantly closer to the exact values as compared to those obtained using either Schubert-Glanzel formula or Egghe-Liang-Rousseau's power law model. This enables us to conclude that Theorem 2 provides significant improvements over both Schubert-Glanzel formula as well as Egghe-Liang-Rousseau's model.

Further, we computed the upper bound given by Theorem 3 which states that Inline graphic, where Inline graphic denotes the Inline graphic-index. We observed that the upper bound on Inline graphic-index given by Theorem 3 is reasonably tight for the given citation record of Price Medalists. In future, one may propose more tight bounds for either Inline graphic-index or Inline graphic-index.

Supporting Information

Medalist S1

Citation data for Price Medalist 1 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 1.

(DOC)

Medalist S2

Citation data for Price Medalist 2 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 2.

(DOC)

Medalist S3

Citation data for Price Medalist 3 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 3.

(DOC)

Medalist S4

Citation data for Price Medalist 4 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 4.

(DOC)

Medalist S5

Citation data for Price Medalist 5 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 5.

(DOC)

Acknowledgments

I thank anonymous reviewers for their helpful suggestions.

Footnotes

Competing Interests: The author has declared that no competing interests exist.

Funding: No current external funding sources for this study.

References

  • 1.Hirsch JE. An index to quantify an individual's research output. Proceedings of National Academy of Sciences. 2005;102:16569–16572. doi: 10.1073/pnas.0507655102. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 2.Egghe L. An improvement of the h-index: the g-index. ISSI Newsletter. 2006;2:8–9. [Google Scholar]
  • 3.Zhang CT. The e-index, complementing the h-index for excess citations. PloS One. 2009;4 doi: 10.1371/journal.pone.0005429. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 4.Garfield E. The history and meaning of the journal impact factor. The Journal of the American Medical Association. 2006;295:90–93. doi: 10.1001/jama.295.1.90. [DOI] [PubMed] [Google Scholar]
  • 5.Zhang CT. Relationship of the h-index, g-index, and e-index. Journal of the American Society for Information Science and Technology. 2010;61:625–628. [Google Scholar]
  • 6.Egghe L, Liang L, Rousseau R. A relation between h-index and impact factor in the power-law model. Journal of the American Society for Information Science and Technology. 2009;60:2362–2365. [Google Scholar]
  • 7.Burrell QL. On hirsch's h, egghe's g, and kolsmulski's h(2). Scientometrics. 2009;79:79–91. [Google Scholar]
  • 8.Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. Cambridge, USA: MIT Press; 2009. [Google Scholar]
  • 9.Schubert A, Glanzel W. A systematic analysis of hirsch-type indices for journals. Journal of Informetrics. 2007;1:179–183. [Google Scholar]
  • 10.Ye FY. An investigation on mathematical models of the h-index. Scientometrics. 2009;81:493–498. [Google Scholar]
  • 11.Roussel N. Scholar index. 2011. Accessed on October 7, 2011.

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Medalist S1

Citation data for Price Medalist 1 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 1.

(DOC)

Medalist S2

Citation data for Price Medalist 2 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 2.

(DOC)

Medalist S3

Citation data for Price Medalist 3 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 3.

(DOC)

Medalist S4

Citation data for Price Medalist 4 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 4.

(DOC)

Medalist S5

Citation data for Price Medalist 5 using scHolar index [11] , which is based on Google Scholar. Includes the numbers of citations of each referenced paper of Price Medalist 5.

(DOC)


Articles from PLoS ONE are provided here courtesy of PLOS

RESOURCES