| Display title | Johnson graph |
| Default sort key | Johnson graph |
| Page length (in bytes) | 9,624 |
| Namespace ID | 0 |
| Page ID | 242736 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image | Error creating thumbnail: Unable to save thumbnail to destination |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Raymond Straus |
| Date of page creation | 14:09, 6 February 2024 |
| Latest editor | imported>Raymond Straus |
| Date of latest edit | 14:09, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph $ J(n,k) $ are the $ k $-element subsets of an $ n $-element set; two vertices are adjacent when the intersection of the two vertices (subsets) contains $ (k-1) $-elements. Both Johnson... |
