Topic · Graph theory and applications
Most cited papers in Graph theory and applications
What are the most cited papers in Graph theory and applications?
The most cited paper in Graph theory and applications is "A tutorial on spectral clustering" (Ulrike von Luxburg, 2007), with 10,505 citations. Next come "A Set of Measures of Centrality Based on Betweenness" (10,473) and "Spectral Graph Theory" (5,771).
Showing 50 of 100 papers. Every paper with more than 522 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | A tutorial on spectral clustering Ulrike von Luxburg · Statistics and Computing | 21 Aug 2007 | 10,505 |
| 2 | A Set of Measures of Centrality Based on Betweenness Linton C. Freeman · Sociometry | Mar 1977 | 10,473 |
| 3 | Spectral Graph Theory Fan Chung · Regional conference series in mathematics | 3 Dec 1996 | 5,771 |
| 4 | Inequalities: Theory of Majorization and its Applications. Barry C. Arnold, Albert W. Marshall, Ingram Olkin · Journal of the American Statistical Association | Jun 1981 | 5,007 |
| 5 | Finding community structure in networks using the eigenvectors of matrices Mark E. J. Newman · Physical Review E | 11 Sep 2006 | 4,927 |
| 6 | Catastrophic cascade of failures in interdependent networks Sergey V. Buldyrev, Roni Parshani, Gerald Paul et al. · Nature | Apr 2010 | 4,511 |
| 7 | Random graphs with arbitrary degree distributions and their applications Mark E. J. Newman, Steven H. Strogatz, Duncan J. Watts · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics | 24 Jul 2001 | 3,743 |
| 8 | Multilayer networks Mikko Kivelä, Àlex Arenas, Marc Barthélemy et al. · Journal of Complex Networks | 14 Jul 2014 | 3,216 |
| 9 | A measure of betweenness centrality based on random walks Mark E. J. Newman · Social Networks | 2005 | 2,517 |
| 10 | The Centrality Index of a Graph Gert Sabidussi · Psychometrika | Dec 1966 | 2,510 |
| 11 | A critical point for random graphs with a given degree sequence Michael S. O. Molloy, Bruce A. Reed · Random Structures and Algorithms | Mar 1995 | 2,427 |
| 12 | Decreased Clearance of CNS β-Amyloid in Alzheimer’s Disease Kwasi G. Mawuenyega, Wendy C. Sigurdson, Vitaliy Ovod et al. · Science | 9 Dec 2010 | 2,128 |
| 13 | Distance-Regular Graphs Andries E. Brouwer, Willem H. Haemers · Universitext | 30 Nov 2011 | 1,998 |
| 14 | Attack vulnerability of complex networks Petter Holme, Beom Jun Kim, Chang No Yoon et al. · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics | 7 May 2002 | 1,917 |
| 15 | Computing topological parameters of biological networks Yassen Assenov, Fidel Ramírez, Sven-Eric Schelhorn et al. · Bioinformatics | 15 Nov 2007 | 1,899 |
| 16 | Predicting missing links via local information Tao Zhou, Linyuan Lü, Yi‐Cheng Zhang · The European Physical Journal B | Oct 2009 | 1,851 |
| 17 | On the Shannon capacity of a graph László Lovász · IEEE Transactions on Information Theory | 1979 | 1,675 |
| 18 | Some unique properties of eigenvector centrality Phillip Bonacich · Social Networks | 6 May 2007 | 1,602 |
| 19 | Laplacian matrices of graphs: a survey Russell Merris · Linear Algebra and its Applications | 1994 | 1,546 |
| 20 | Paths, Trees, and Flowers Jack Edmonds · Birkhäuser Boston eBooks | 2009 | 1,534 |
| 21 | New Specifications for Exponential Random Graph Models Tom A. B. Snijders, Philippa Eleanor Pattison, Garry L. Robins et al. · Sociological Methodology | Aug 2006 | 1,472 |
| 22 | Resistance distance Douglas J. Klein, Milan Randić · Journal of Mathematical Chemistry | Dec 1993 | 1,377 |
| 23 | INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS Péter L. Erdős, Chao Ko, R. Rado · The Quarterly Journal of Mathematics | 1961 | 1,355 |
| 24 | Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons Haruo Hosoya · Bulletin of the Chemical Society of Japan | Sep 1971 | 1,288 |
| 25 | On Modularity Clustering Ulrik Brandes, Daniel Delling, Marco Gaertler et al. · IEEE Transactions on Knowledge and Data Engineering | 4 Jan 2008 | 1,271 |
| 26 | Universal Behavior of Load Distribution in Scale-Free Networks K.-I. Goh, B. Kahng, D. Kim · Physical Review Letters | 12 Dec 2001 | 1,262 |
| 27 | Which NICS Aromaticity Index for Planar π Rings Is Best? Hossain Fallah‐Bagher‐Shaidaei, Chaitanya S. Wannere, Clémence Corminbœuf et al. · Organic Letters | 2 Feb 2006 | 1,252 |
| 28 | A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs Béla Bollobás · European Journal of Combinatorics | Dec 1980 | 1,208 |
| 29 | Eigenvalues and expanders Noga Alon · COMBINATORICA | Jun 1986 | 1,180 |
| 30 | Structural conversion of neurotoxic amyloid-β1–42 oligomers to fibrils Mahiuddin Ahmed, Judianne Davis, Darryl Aucoin et al. · Nature Structural & Molecular Biology | 11 Apr 2010 | 1,120 |
| 31 | Centrality in valued graphs: A measure of betweenness based on network flow Linton C. Freeman, Stephen P. Borgatti, Dougľas R. White · Social Networks | Jun 1991 | 1,082 |
| 32 | A Contribution to the Theory of Chromatic Polynomials W. T. Tutte · Canadian Journal of Mathematics | 1954 | 1,037 |
| 33 | On variants of shortest-path betweenness centrality and their generic computation Ulrik Brandes · Social Networks | 20 Feb 2008 | 1,021 |
| 34 | Ramanujan graphs Alexander Lubotzky, Ralph S. Phillips, Peter Sarnak · COMBINATORICA | Sep 1988 | 1,015 |
| 35 | Wiener Index of Trees: Theory and Applications Andrey A. Dobrynin, Roger C. Entringer, İvan Gutman · Acta Applicandae Mathematicae | May 2001 | 1,014 |
| 36 | The asymptotic number of labeled graphs with given degree sequences Edward A. Bender, E. Rodney Canfield · Journal of Combinatorial Theory Series A | May 1978 | 1,002 |
| 37 | A forgotten topological index Boris Furtula, İvan Gutman · Journal of Mathematical Chemistry | 5 Feb 2015 | 1,001 |
| 38 | Connected Components in Random Graphs with Given Expected Degree Sequences Fan Chung, Linyuan Lü · Annals of Combinatorics | Nov 2002 | 976 |
| 39 | Convexity and Commuting Hamiltonians Michael Francis Atiyah · Bulletin of the London Mathematical Society | 1982 | 975 |
| 40 | Mathematical Formulation of Multilayer Networks Manlio De Domenico, Albert Solé-Ribalta, Emanuele Cozzo et al. · Physical Review X | 4 Dec 2013 | 935 |
| 41 | Extracting the multiscale backbone of complex weighted networks M. Ángeles Serrano, Marián Boguñá, Alessandro Vespignani · Proceedings of the National Academy of Sciences | 8 Apr 2009 | 929 |
| 42 | A proof of the Bieberbach conjecture Louis de Branges · Acta Mathematica | 1985 | 916 |
| 43 | The Many Faces of Tau Meaghan Morris, Sumihiro Maeda, Keith A. Vossel et al. · Neuron | May 2011 | 912 |
| 44 | λ1, Isoperimetric inequalities for graphs, and superconcentrators Noga Alon, Vitali Davidovich Milman · Journal of Combinatorial Theory Series B | Feb 1985 | 878 |
| 45 | Epidemic spreading in real networks: an eigenvalue viewpoint Yang Wang, Deepayan Chakrabarti, Chenxi Wang et al. | Mar 2004 | 876 |
| 46 | Degree-Based Topological Indices İvan Gutman · Croatica Chemica Acta | 2013 | 866 |
| 47 | On cliques in graphs John W. Moon, Leo Moser · Israel Journal of Mathematics | Mar 1965 | 864 |
| 48 | The Size of the Giant Component of a Random Graph with a Given Degree Sequence Michael S. O. Molloy, Bruce A. Reed · Combinatorics Probability Computing | Sep 1998 | 857 |
| 49 | Limits of dense graph sequences László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B | 22 Jun 2006 | 854 |
| 50 | Complement reducible graphs Derek Gordon Corneil, H. Lerchs, L.Stewart Burlingham · Discrete Applied Mathematics | Jul 1981 | 845 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.