Abstract
We consider finite graphs with the property that there exists a constant e such that for every maximal clique M and vertex x not in M, x is adjacent to exactly e vertices in M. It is shown that these graphs have a highly geometric structure which in many ways resembles that of the polar spaces.
| Original language | English |
|---|---|
| Pages (from-to) | 105-114 |
| Journal | European Journal of Combinatorics |
| Volume | 7 |
| Publication status | Published - 1986 |
Fingerprint
Dive into the research topics of 'A class of graphs containing the polar spaces'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver