A (49,16,3,6) strongly regular graph does not exist
type: Item
instance of: scholarly article
title: A (49,16,3,6) strongly regular graph does not exist
zbMATH Open document ID: 0683.05024
DOI: 10.1016/S0195-6698(89)80014-9
author: Willem H. Haemers
author: H. A. Wilbrink
author: Bussemaker, Frans C.
author: Rudolf Mathon
published in: European Journal of Combinatorics
publication date: 1989-01-01T00:00:00Z
review text: A (49,16,3,6) strongly regular graph has 49 vertices, each vertex has 16 neighbours, any two adjacent vertices have three common neighbours, and any two distinct non-adjacent vertices have six common neighbours. It is proved that such a graph does not exist. The proof uses counting techniques, eigenvalues and a computer.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 4118396
zbMATH Keywords: strongly regular graph
zbMATH Keywords: counting techniques
zbMATH Keywords: eigenvalues
zbMATH Keywords: computer
reviewed by: Ulrich Knauer
MaRDI profile type: Publication
cites work: Q3218138
cites work: Q4749873
description: scientific article; zbMATH DE number 4118396