A strongly regularN-full graph of small order |
| |
Authors: | Van H Vu |
| |
Institution: | (1) Department of Mathematics, Yale University, 06520 New Haven, CT, USA |
| |
Abstract: | For every positive integern we show the construction of a strongly regular graph of order at most 2
n+2 which contains every graph of ordern as a subgraph. The estimation concerning the construction is best possible. |
| |
Keywords: | 05 C 35 |
本文献已被 SpringerLink 等数据库收录! |
|