Lesson plan
Fan graph
P_n and empty graph K_1 in each fan graph F_n are colored blue and orange respectively In graph theory, a fan graph (also called a path-fan graph) is a graph formed by the join of a path graph and an empty graph on a single vertex. The fan graph on n + 1 vertices, denoted F_n , is defined as K_1 + P_n , where K_1 is a single vertex and P_n is a path on n vertices. The fan graph F_n has n + 1 vertices and 2n - 1 edges.
Article summary
P_n and empty graph K_1 in each fan graph F_n are colored blue and orange respectively In graph theory, a fan graph (also called a path-fan graph) is a graph formed by the join of a path graph and an empty graph on a single vertex. The fan graph on n + 1 vertices, denoted F_n , is defined as K_1 + P_n , where K_1 is a single vertex and P_n is a path on n vertices. The fan graph F_n has n + 1 vertices and 2n - 1 edges.
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.