Partitioning strongly regular graphs (Q1062989): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning strongly regular graphs |
scientific article |
Statements
Partitioning strongly regular graphs (English)
0 references
1985
0 references
An interesting investigation of strongly regular graphs whose vertices can be partitioned into two subsets of equal size on each of which a strongly regular subgraph is induced. Examples are the Higman-Sims graph, the subconstituents of the McLaughlin graph, and some graphs constructed from difference sets. In general, such graphs must belong either to the two parameter family of Smith graphs, or to a special one parameter family of graphs.
0 references
strongly regular graphs
0 references
Smith graphs
0 references
