Bagchi, Bhaskar (2006) On strongly regular graphs with μ≤2 Discrete Mathematics, 306 (14). pp. 1502-1504. ISSN 0012-365X
Full text not available from this repository.
Official URL: http://dx.doi.org//10.1016/j.disc.2005.05.007
Related URL: http://dx.doi.org/10.1016/j.disc.2005.05.007
Abstract
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any strongly regular graph with μ=2 is either a grid graph or satisfies k ≥½λ(λ+3). This improves upon a previous result of Brouwer and Neumaier who gave a necessary restriction on the parameters of strongly regular graphs with μ=2 and k < ½λ(λ+3) .
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 1012 |
| Deposited On: | 25 Sep 2010 11:21 |
| Last Modified: | 09 Oct 2010 07:45 |
Repository Staff Only: item control page
