隣接行列 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "隣接行列" in Japanese language version.

refsWebsite

Global rank Japanese rank

2^nd place

6^th place

451^st place

1,252^nd place

18^th place

107^th place

3^rd place

61^st place

942^nd place

3,490^th place

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 .
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, MR749658 .

Shum, Kenneth; Blake, Ian (18 December 2003). "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.

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.
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, MR749658 .

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 .