Adjacency matrix (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Adjacency matrix" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

451^st place

277^th place

2books.google.com

3^rd place

3^rd place

18^th place

17^th place

5,952^nd place

3,809^th place

1sciencedirect.com

149^th place

178^th place

5^th place

5^th place

942^nd place

597^th place

1web.archive.org

1^st place

1^st place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Harary, Frank (1962), "The determinant of the adjacency matrix of a graph", SIAM Review, 4 (3): 202–210, Bibcode:1962SIAMR...4..202H, doi:10.1137/1004057, MR 0144330.
Brouwer, Andries E.; Haemers, Willem H. (2012), "1.3.6 Bipartite graphs", Spectra of Graphs, Universitext, New York: Springer, pp. 6–7, doi:10.1007/978-1-4614-1939-6, ISBN 978-1-4614-1938-9, MR 2882891
Turán, György (1984), "On the succinct representation of graphs", Discrete Applied Mathematics, 8 (3): 289–294, doi:10.1016/0166-218X(84)90126-4, MR 0749658.

anu.edu.au (Global: 942^nd place; English: 597^th place)

cs.anu.edu.au

McKay, Brendan, Description of graph6 and sparse6 encodings, archived from the original on 2001-04-30, retrieved 2012-02-10.

books.google.com (Global: 3^rd place; English: 3^rd place)

Shum, Kenneth; Blake, Ian (2003-12-18). "Expander graphs and codes". Volume 68 of DIMACS series in discrete mathematics and theoretical computer science. Algebraic Coding Theory and Information Theory: DIMACS Workshop, Algebraic Coding Theory and Information Theory. American Mathematical Society. p. 63. ISBN 9780821871102.
Brouwer, Andries E.; Haemers, Willem H. (2012), "1.3.6 Bipartite graphs", Spectra of Graphs, Universitext, New York: Springer, pp. 6–7, doi:10.1007/978-1-4614-1939-6, ISBN 978-1-4614-1938-9, MR 2882891

clemson.edu (Global: 5,952^nd place; English: 3,809^th place)

people.computing.clemson.edu

"A Brief Introduction to Graph Theory" (PDF). www.people.computing.clemson.edu. Retrieved 8 December 2025.

doi.org (Global: 2^nd place; English: 2^nd place)

Harary, Frank (1962), "The determinant of the adjacency matrix of a graph", SIAM Review, 4 (3): 202–210, Bibcode:1962SIAMR...4..202H, doi:10.1137/1004057, MR 0144330.
Seidel, J. J. (1968). "Strongly Regular Graphs with (−1, 1, 0) Adjacency Matrix Having Eigenvalue 3". Lin. Alg. Appl. 1 (2): 281–298. doi:10.1016/0024-3795(68)90008-6.
Brouwer, Andries E.; Haemers, Willem H. (2012), "1.3.6 Bipartite graphs", Spectra of Graphs, Universitext, New York: Springer, pp. 6–7, doi:10.1007/978-1-4614-1939-6, ISBN 978-1-4614-1938-9, MR 2882891
Nicholson, Victor A. (1975-01-01). "Matrices with permanent equal to one". Linear Algebra and its Applications. 12 (2): 187. doi:10.1016/0024-3795(75)90067-1. ISSN 0024-3795.
Turán, György (1984), "On the succinct representation of graphs", Discrete Applied Mathematics, 8 (3): 289–294, doi:10.1016/0166-218X(84)90126-4, MR 0749658.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Harary, Frank (1962), "The determinant of the adjacency matrix of a graph", SIAM Review, 4 (3): 202–210, Bibcode:1962SIAMR...4..202H, doi:10.1137/1004057, MR 0144330.

sciencedirect.com (Global: 149^th place; English: 178^th place)

Nicholson, Victor A. (1975-01-01). "Matrices with permanent equal to one". Linear Algebra and its Applications. 12 (2): 187. doi:10.1016/0024-3795(75)90067-1. ISSN 0024-3795.

web.archive.org (Global: 1^st place; English: 1^st place)

McKay, Brendan, Description of graph6 and sparse6 encodings, archived from the original on 2001-04-30, retrieved 2012-02-10.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Nicholson, Victor A. (1975-01-01). "Matrices with permanent equal to one". Linear Algebra and its Applications. 12 (2): 187. doi:10.1016/0024-3795(75)90067-1. ISSN 0024-3795.