Name
Abstract | ||
|---|---|---|
We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in terms of the number of common neighbours of two adjacent vertices is derived. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/eujc.2000.0472 | European Journal of Combinatorics |
DocType | Volume | Issue |
Journal | 22 | 3 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Deutsch | 1 | 0 | 0.34 |
| P. H. Fisher | 2 | 1 | 0.77 |