A prolific construction of strongly regular graphs with the -e. c. property.
Cameron, Peter J.; Stark, Dudley
The Electronic Journal of Combinatorics [electronic only] (2002)
- Volume: 9, Issue: 1, page Research paper R31, 12 p.-Research paper R31, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCameron, Peter J., and Stark, Dudley. "A prolific construction of strongly regular graphs with the -e. c. property.." The Electronic Journal of Combinatorics [electronic only] 9.1 (2002): Research paper R31, 12 p.-Research paper R31, 12 p.. <http://eudml.org/doc/122390>.
@article{Cameron2002,
author = {Cameron, Peter J., Stark, Dudley},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Paley graphs; affine designs; Hadamard designs; Paley tournaments},
language = {eng},
number = {1},
pages = {Research paper R31, 12 p.-Research paper R31, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A prolific construction of strongly regular graphs with the -e. c. property.},
url = {http://eudml.org/doc/122390},
volume = {9},
year = {2002},
}
TY - JOUR
AU - Cameron, Peter J.
AU - Stark, Dudley
TI - A prolific construction of strongly regular graphs with the -e. c. property.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2002
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 9
IS - 1
SP - Research paper R31, 12 p.
EP - Research paper R31, 12 p.
LA - eng
KW - Paley graphs; affine designs; Hadamard designs; Paley tournaments
UR - http://eudml.org/doc/122390
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.