Math 2.0

Concept

Crown graph

Summary

In graph theory, a branch of mathematics, a crown graph on 2n2n vertices is an undirected graph with two sets of vertices {u1,u2,…,un}\{u_{1}, u_{2}, \ldots, u_{n}\} and {v1,v2,…,vn}\{v_{1}, v_{2}, \ldots, v_{n}\} and with an edge from uiu_{i} to vjv_{j} whenever i≠ji \ne j.

Further reading

  1. Wikipedia, page 21062705, revision 1301545999, Crown graph. adopted
About this page
TagTM2DNJZHC1
URIm2://TM2DNJZHC1
Kindconcept
WritingW1 stated
Same as
Changed4 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.