bn:01384762n
Noun Concept
Categories: Parametric families of graphs, Regular graphs
EN
crown graph
EN
In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices {u1, u2, …, un} and {v1, v2, …, vn} and with an edge from ui to vj whenever i ≠ j. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices {u1, u2, …, un} and {v1, v2, …, vn} and with an edge from ui to vj whenever i ≠ j. Wikipedia
A type of undirected graph in graph theory Wikipedia Disambiguation
In graph theory Wikidata
An undirected graph with 2n vertices in the two sets { u1, u2, ..., un } and { v1, v2, ..., vn } and with an edge from ui to vj whenever i ≠ j. Wiktionary
Wikipedia
Wikidata
Wiktionary