گراف جانسون (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "گراف جانسون" in Persian language version.

refsWebsite

Global rank Persian rank

3arxiv.org

69^th place

253^rd place

3harvard.edu

18^th place

50^th place

2books.google.com

3^rd place

6^th place

2doi.org

2^nd place

2ams.org

451^st place

931^st place

2worldcat.org

5^th place

12^th place

1imfm.si

low place

1tue.nl

9,054^th place

low place

ams.org (Global: 451^st place; Persian: 931^st place)

Holton, D. A.; Sheehan, J. (1993), "The Johnson graphs and even graphs", The Petersen graph, Australian Mathematical Society Lecture Series, vol. 7, Cambridge: Cambridge University Press, p. 300, doi:10.1017/CBO9780511662058, ISBN 0-521-43594-3, MR 1232658.
The explicit identification of graphs with association schemes, in this way, can be seen in Bose, R. C. (1963), "Strongly regular graphs, partial geometries and partially balanced designs", Pacific Journal of Mathematics, 13: 389–419, doi:10.2140/pjm.1963.13.389, MR 0157909 {{citation}}: More than one of |DOI= و |doi= specified (help); More than one of |MR= و |mr= specified (help); More than one of |work= و |journal= specified (help)More than one of |work= and |journal= specified (help); More than one of |mr= and |MR= specified (help); More than one of |DOI= and |doi= specified (help) .

arxiv.org (Global: 69^th place; Persian: 253^rd place)

Newman, Ilan; Rabinovich, Yuri (2015), On Connectivity of the Facet Graphs of Simplicial Complexes, arXiv:1502.02232, Bibcode:2015arXiv150202232N {{citation}}: More than one of |first1= و |first= specified (help); More than one of |last1= و |last= specified (help)More than one of |last1= and |last= specified (help); More than one of |first1= and |first= specified (help)
Rispoli, Fred J. (2008), The graph of the hypersimplex, arXiv:0811.2981, Bibcode:2008arXiv0811.2981R
Filmus, Yuval (2014), Orthogonal basis for functions over a slice of the Boolean hypercube, arXiv:1406.0142, Bibcode:2014arXiv1406.0142F

books.google.com (Global: 3^rd place; Persian: 6^th place)

Holton, D. A.; Sheehan, J. (1993), "The Johnson graphs and even graphs", The Petersen graph, Australian Mathematical Society Lecture Series, vol. 7, Cambridge: Cambridge University Press, p. 300, doi:10.1017/CBO9780511662058, ISBN 0-521-43594-3, MR 1232658.
Cameron, Peter J. (1999), Permutation Groups, London Mathematical Society Student Texts, vol. 45, Cambridge University Press, p. 95, ISBN 978-0-521-65378-7 {{citation}}: More than one of |ISBN= و |isbn= specified (help)More than one of |ISBN= and |isbn= specified (help) .

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

Holton, D. A.; Sheehan, J. (1993), "The Johnson graphs and even graphs", The Petersen graph, Australian Mathematical Society Lecture Series, vol. 7, Cambridge: Cambridge University Press, p. 300, doi:10.1017/CBO9780511662058, ISBN 0-521-43594-3, MR 1232658.
The explicit identification of graphs with association schemes, in this way, can be seen in Bose, R. C. (1963), "Strongly regular graphs, partial geometries and partially balanced designs", Pacific Journal of Mathematics, 13: 389–419, doi:10.2140/pjm.1963.13.389, MR 0157909 {{citation}}: More than one of |DOI= و |doi= specified (help); More than one of |MR= و |mr= specified (help); More than one of |work= و |journal= specified (help)More than one of |work= and |journal= specified (help); More than one of |mr= and |MR= specified (help); More than one of |DOI= and |doi= specified (help) .

harvard.edu (Global: 18^th place; Persian: 50^th place)

ui.adsabs.harvard.edu

Newman, Ilan; Rabinovich, Yuri (2015), On Connectivity of the Facet Graphs of Simplicial Complexes, arXiv:1502.02232, Bibcode:2015arXiv150202232N {{citation}}: More than one of |first1= و |first= specified (help); More than one of |last1= و |last= specified (help)More than one of |last1= and |last= specified (help); More than one of |first1= and |first= specified (help)
Rispoli, Fred J. (2008), The graph of the hypersimplex, arXiv:0811.2981, Bibcode:2008arXiv0811.2981R
Filmus, Yuval (2014), Orthogonal basis for functions over a slice of the Boolean hypercube, arXiv:1406.0142, Bibcode:2014arXiv1406.0142F

imfm.si (Global: low place; Persian: low place)

amc.imfm.si

Alspach, Brian (2013), "Johnson graphs are Hamilton-connected", Ars Mathematica Contemporanea, 6 (1): 21–23 {{citation}}: More than one of |authorlink= و |author-link= specified (help); More than one of |work= و |journal= specified (help)More than one of |author-link= and |authorlink= specified (help); More than one of |work= and |journal= specified (help) .

tue.nl (Global: 9,054^th place; Persian: low place)

win.tue.nl

"Johnson". www.win.tue.nl. Retrieved 2017-07-26.

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

E., Brouwer, Andries (1989). Distance-Regular Graphs. Cohen, Arjeh M. , Neumaier, Arnold. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 978-3-642-74343-6. OCLC 851840609.
1949-, Godsil, C. D. (Christopher David),. Erdős-Ko-Rado theorems: algebraic approaches. Meagher, Karen (College teacher),. Cambridge, United Kingdom. ISBN 978-1-107-12844-6. OCLC 935456305.{{cite book}}: CS1 maint: numeric names: فهرست نویسندگان (link) نگهداری CS1: نقطه‌گذاری اضافه (link)

گراف جانسون (Persian Wikipedia)

ams.org (Global: 451st place; Persian: 931st place)

arxiv.org (Global: 69th place; Persian: 253rd place)

books.google.com (Global: 3rd place; Persian: 6th place)

doi.org (Global: 2nd place; Persian: 2nd place)

harvard.edu (Global: 18th place; Persian: 50th place)