Hoffman–Singleton graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hoffman–Singleton graph" in English language version.

refsWebsite

Global rank English rank

4tue.nl

9,054^th place

6,363^rd place

2ams.org

451^st place

277^th place

1wolfram.com

513^th place

537^th place

1nodak.edu

5,218^th place

9,258^th place

1ibm.com

1,131^st place

850^th place

1doi.org

2^nd place

1arxiv.org

69^th place

59^th place

1mathstodon.xyz

low place

ams.org

mathscinet.ams.org

Hoffman, Alan J.; Singleton, Robert R. (1960), "Moore graphs with diameter 2 and 3" (PDF), IBM Journal of Research and Development, 5 (4): 497–504, doi:10.1147/rd.45.0497, MR 0140437.

blogs.ams.org

Baez, John (February 1, 2016), "Hoffman–Singleton Graph", Visual Insight, American Mathematical Society

arxiv.org

Chishwashwa, N.; Faber, V.; Streib, N. (2022). "Digraph Networks and Groupoids". arXiv:2208.10537 [math.CO].

doi.org

Hoffman, Alan J.; Singleton, Robert R. (1960), "Moore graphs with diameter 2 and 3" (PDF), IBM Journal of Research and Development, 5 (4): 497–504, doi:10.1147/rd.45.0497, MR 0140437.

ibm.com

research.ibm.com

Hoffman, Alan J.; Singleton, Robert R. (1960), "Moore graphs with diameter 2 and 3" (PDF), IBM Journal of Research and Development, 5 (4): 497–504, doi:10.1147/rd.45.0497, MR 0140437.

mathstodon.xyz

Harder, Jannis, Messages on Mastodon

nodak.edu

listserv.nodak.edu

Royle, G. "Re: What is the Edge Chromatic Number of Hoffman-Singleton?" GRAPHNET@listserv.nodak.edu posting. Sept. 28, 2004. [1]