Lesson plan
Johnson graph
In mathematics, 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 graphs and the closely related Johnson scheme are named after Selmer M. Johnson.
Article summary
In mathematics, 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 graphs and the closely related Johnson scheme are named after Selmer M. Johnson.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.