Reguljär graf (Swedish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Reguljär graf" in Swedish language version.

refsWebsite

Global rank Swedish rank

2^nd place

14^th place

5,814^th place

low place

1plattsburgh.edu

low place

low place

1web.archive.org

1^st place

1^st place

1uni-bayreuth.de

low place

low place

doi.org

dx.doi.org

Curtin, Brian (2005), ”Algebraic characterizations of graph regularity conditions”, Designs, Codes and Cryptography 34 (2-3): 241–248, doi:10.1007/s10623-004-4857-4 .
Meringer, Markus (1999). ”Fast generation of regular graphs and construction of cages”. Journal of Graph Theory 30 (2): sid. 137–146. doi:10.1002/(SICI)1097-0118(199902)30:2<>1.0.CO;2-G. http://www.mathe2.uni-bayreuth.de/markus/pdf/pub/FastGenRegGraphJGT.pdf.

elte.hu

compalg.inf.elte.hu

Ashay Dharwadker, Shariefuddin Pirzada, 2011, Graph Theory, ISBN 1466254998, sid. 74.

plattsburgh.edu

personal.plattsburgh.edu

Gregory Quenell, 1992, Spectral diameter estimates for k-regular graphs Arkiverad 6 januari 2014 hämtat från the Wayback Machine., Advances in Mathematics 106, 1994, sid. 122-148.

uni-bayreuth.de

mathe2.uni-bayreuth.de

Meringer, Markus (1999). ”Fast generation of regular graphs and construction of cages”. Journal of Graph Theory 30 (2): sid. 137–146. doi:10.1002/(SICI)1097-0118(199902)30:2<>1.0.CO;2-G. http://www.mathe2.uni-bayreuth.de/markus/pdf/pub/FastGenRegGraphJGT.pdf.

web.archive.org

Gregory Quenell, 1992, Spectral diameter estimates for k-regular graphs Arkiverad 6 januari 2014 hämtat från the Wayback Machine., Advances in Mathematics 106, 1994, sid. 122-148.