Extension of strongly regular graphs.
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper N3, 5 p.-Research Paper N3, 5 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGera, Ralucca, and Shen, Jian. "Extension of strongly regular graphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper N3, 5 p.-Research Paper N3, 5 p.. <http://eudml.org/doc/129722>.
@article{Gera2008,
author = {Gera, Ralucca, Shen, Jian},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {strongly regular graph; friendship theorem; common friend; friend of everybody},
language = {eng},
number = {1},
pages = {Research Paper N3, 5 p.-Research Paper N3, 5 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Extension of strongly regular graphs.},
url = {http://eudml.org/doc/129722},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Gera, Ralucca
AU - Shen, Jian
TI - Extension of strongly regular graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper N3, 5 p.
EP - Research Paper N3, 5 p.
LA - eng
KW - strongly regular graph; friendship theorem; common friend; friend of everybody
UR - http://eudml.org/doc/129722
ER -
Citations in EuDML Documents
topNotesEmbed ?
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.