عدد اردوش و شبکۀ تألیف‌های مشترک: نگاهی به کاربردی از نظریهٔ گراف در علم‌سنجی

[1] V. D. Blondel, J.-L. Guillaume, R. Lambiotte and E. Lefebvre, Fast unfolding of communities in large networks, J. Stat. Mech., (2008). doi.org/10.1088/1742-5468/2008/10/P10008.
[2] DBLP Team, DBLP: computer science bibliography, available at https://dblp.org/, 2021.
[3] R. De Castro and J. W. Grossman, Famous trails to Paul Erdős, Math. Intelligencer, 21 (1999) 51–53.
[4] T. M. J. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Softw: Pract. Exper., 21 (1991) 1129–1164.
[5] C. Goffman, And what is your Erdős number?, Amer. Math. Monthly, 76 (1969) 791–791.
[6] J. W. Grossman, Paul Erdős: The master of collaboration, Algorithms and Combinatorics, 14 (1997) 467–475.
[7] J. W. Grossman, The Erdős number project, available at https://oakland.edu/en, 2021.
[8] J. W. Grossman, Facts about Erdős numbers and the collaboration graph, The Erdős number project, available at https://oakland.edu/enp, 2021.
[9] J. W. Grossman and P. D. F. Ion, On a portion of the well-known collaboration graph, Congr. Numer., 108 (1995) 129–132.
[10] G. Harirchi, G. Melin and Sh. Etemad, An exploratory study of the feature of Iranian co-authorships in biology, chemistry and physics, Scientometrics, 72 (2007) 11–24.
[11] M. Jacomy, T. Venturini, S. Heymann and M. Bastian, ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software, PLoS ONE, 9 (2014) 12 pp. doi:10.1371/journal.pone.009867
[12] V. Ströele, R. Crivano, G. Zimbrão, J. M. Souza, F. Campos, J. M. N. David and R. Braga, Rational Erdös number and maximum flow as measurement models for scientific social network analysis, J. Brazilian Computer Soc., 24 (2018) 17 pp.
[13] M. E. Newman, Coauthorship networks and patterns of scientific collaboration, Proc. Natal. Acad. Sci. USA, 101 (2004) 5200–5205.
[14] M. E. J. Newman, Networks: An Introduction, OUP, Oxford, 2010.