Crown graph
id:
crown-graph-284-8064201
title:
Crown graph
text:
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. The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, as the tensor product Kn × K2, as the complement of the Cartesian direct product of Kn and K2, or as a bipartite Kneser grap
brand slug:
wiki
category slug:
encyclopedia
description:
Family of graphs with 2n nodes and n(n-1) edges
original url:
https://en.wikipedia.org/wiki/Crown_graph
date created:
date modified:
2024-03-06T07:49:58Z
main entity:
{"identifier":"Q3115466","url":"https://www.wikidata.org/entity/Q3115466"}
image:
fields total:
13
integrity:
14