Fan graph
Summary
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 vertices, denoted , is defined as , where is a single vertex and is a path on vertices.
Further reading
- Wikipedia, page 81762753, revision 1326288613, Fan graph. adopted
About this page
| Tag | 3E80DQEDKV |
|---|---|
| URI | m2://3E80DQEDKV |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.