A (49, 16, 3, 6) strongly regular graph does not exist

F.C. Bussemaker, W.H. Haemers, R.A. Mathon, H.A. Wilbrink

Research output: Contribution to journalArticleProfessional

14 Downloads (Pure)
Original languageEnglish
Pages (from-to)413-418
Number of pages6
JournalEuropean Journal of Combinatorics
Volume10
Publication statusPublished - 1989
Externally publishedYes

Cite this

Bussemaker, F. C., Haemers, W. H., Mathon, R. A., & Wilbrink, H. A. (1989). A (49, 16, 3, 6) strongly regular graph does not exist. European Journal of Combinatorics, 10, 413-418.
Bussemaker, F.C. ; Haemers, W.H. ; Mathon, R.A. ; Wilbrink, H.A. / A (49, 16, 3, 6) strongly regular graph does not exist. In: European Journal of Combinatorics. 1989 ; Vol. 10. pp. 413-418.
@article{157e4743542f468faf6cdb1ef0c414ee,
title = "A (49, 16, 3, 6) strongly regular graph does not exist",
author = "F.C. Bussemaker and W.H. Haemers and R.A. Mathon and H.A. Wilbrink",
note = "Pagination: 6",
year = "1989",
language = "English",
volume = "10",
pages = "413--418",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

Bussemaker, FC, Haemers, WH, Mathon, RA & Wilbrink, HA 1989, 'A (49, 16, 3, 6) strongly regular graph does not exist' European Journal of Combinatorics, vol. 10, pp. 413-418.

A (49, 16, 3, 6) strongly regular graph does not exist. / Bussemaker, F.C.; Haemers, W.H.; Mathon, R.A.; Wilbrink, H.A.

In: European Journal of Combinatorics, Vol. 10, 1989, p. 413-418.

Research output: Contribution to journalArticleProfessional

TY - JOUR

T1 - A (49, 16, 3, 6) strongly regular graph does not exist

AU - Bussemaker, F.C.

AU - Haemers, W.H.

AU - Mathon, R.A.

AU - Wilbrink, H.A.

N1 - Pagination: 6

PY - 1989

Y1 - 1989

M3 - Article

VL - 10

SP - 413

EP - 418

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -