Lesson plan
Nut graph (graph theory)
In graph theory, a nut graph is a finite simple graph with at least two vertices whose adjacency matrix has a nullity equal to one and whose kernel is spanned by a vector with no zero entries. This class of graphs was introduced by Irene Sciriha and Iván Gutman in 1998. Nut graphs arise frequently in spectral graph theory and chemical graph theory.
Article summary
In graph theory, a nut graph is a finite simple graph with at least two vertices whose adjacency matrix has a nullity equal to one and whose kernel is spanned by a vector with no zero entries. This class of graphs was introduced by Irene Sciriha and Iván Gutman in 1998. Nut graphs arise frequently in spectral graph theory and chemical graph theory.
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.