Lesson plan
Cycle graph
{{infobox graph | name = Cycle graph | image = | image_caption = The cycle graph | automorphisms = ( ) | chromatic_number = 3 if is odd 2 otherwise | chromatic_index = 3 if is odd 2 otherwise | girth = | spectrum = {{nowrap| \left\{ 2\cos\left(\frac{2k\pi}{n}\right); k=1,\cdots,n \right\} }} | notation = | properties = 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian Polytopal }} In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called . The number of vertices in equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. Cycle graph C_1 is an isolated loop. Cycle graph C_3 is the same as complete graph K_3 .
Article summary
{{infobox graph | name = Cycle graph | image = | image_caption = The cycle graph | automorphisms = ( ) | chromatic_number = 3 if is odd 2 otherwise | chromatic_index = 3 if is odd 2 otherwise | girth = | spectrum = {{nowrap| \left\{ 2\cos\left(\frac{2k\pi}{n}\right); k=1,\cdots,n \right\} }} | notation = | properties = 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian Polytopal }} In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called . The number of vertices in equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. Cycle graph C_1 is an isolated loop. Cycle graph C_3 is the same as complete graph K_3 .
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.