Frans C. Bussemaker

According to our database, Frans C. Bussemaker authored at least 6 papers between 1977 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2000

The Search for Pseudo Orthogonal Latin Squares of Order Six.

Frans C. Bussemaker, Willem H. Haemers, Edward Spence

Des. Codes Cryptogr., 2000

1990

Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20.

Frans C. Bussemaker, Vladimir D. Tonchev

Discret. Math., 1990

1989

On (<i>v</i>, <i>k</i>, lambda) graphs and designs with trivial automorphism group.

Frans C. Bussemaker, Willem H. Haemers, J. J. Seidel, Edward Spence

J. Comb. Theory A, 1989

A (49, 16, 3, 6) Strongly Regular Graph Does Not Exist.

Frans C. Bussemaker, Willem H. Haemers, R. Matron, Henny A. Wilbrink

Eur. J. Comb., 1989

New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28.

Frans C. Bussemaker, Vladimir D. Tonchev

Discret. Math., 1989

1977

Cubic graphs on <=14 vertices.

Frans C. Bussemaker, S. Cobeljic, Dragos M. Cvetkovic, J. J. Seidel

J. Comb. Theory B, 1977