Lesson plan

crown graph

{{infobox graph | name = Crown graph | image = | image_caption = Crown graphs with six, eight, and ten vertices | automorphisms = | vertices = | edges = | chromatic_number = \left\{\begin{array}{ll}1 & n = 1\\ 2 & \text{otherwise}\end{array}\right. | chromatic_index = | radius = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | diameter = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | girth = \left\{\begin{array}{ll}\infty & n \le 2\\ 6 & n = 3\\ 4 & \text{otherwise}\end{array}\right. | spectrum = | properties = Distance-transitive | notation = S_n^0 }} In graph theory, a branch of mathematics, a crown graph on vertices is an undirected graph with two sets of vertices and and with an edge from to whenever . The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, as the tensor product , as the complement of the Cartesian direct product of and , or as a bipartite Kneser graph representing the 1-item and -item subsets of an -item set, with an edge between two subsets whenever one is contained in the other.

Back to article

Article summary

{{infobox graph | name = Crown graph | image = | image_caption = Crown graphs with six, eight, and ten vertices | automorphisms = | vertices = | edges = | chromatic_number = \left\{\begin{array}{ll}1 & n = 1\\ 2 & \text{otherwise}\end{array}\right. | chromatic_index = | radius = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | diameter = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | girth = \left\{\begin{array}{ll}\infty & n \le 2\\ 6 & n = 3\\ 4 & \text{otherwise}\end{array}\right. | spectrum = | properties = Distance-transitive | notation = S_n^0 }} In graph theory, a branch of mathematics, a crown graph on vertices is an undirected graph with two sets of vertices and and with an edge from to whenever . The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, as the tensor product , as the complement of the Cartesian direct product of and , or as a bipartite Kneser graph representing the 1-item and -item subsets of an -item set, with an edge between two subsets whenever one is contained in the other.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. 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.