Johnson Graphs
Initializing live version
![](/img/demonstrations-branding.png)
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Explore the families of Johnson graphs, or explore the families of Kneser graphs by letting .
Contributed by: Gustavo Gordillo (January 2012)
Open content licensed under CC BY-NC-SA
Snapshots
Details
As defined by Godsil & Royle's Algebraic Graph Theory, let ,
, and
be fixed positive integers, with
; let
be a fixed set of size
; and define
as follows: the vertices of
are the subsets of
with size
. Two subsets are connected by an edge if their intersection has size
.
Permanent Citation