Johnson Graphs

Initializing live version
Download to Desktop

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 .



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send