Windmill graph
id:
windmill-graph-303-16711671
title:
Windmill graph
text:
In the mathematical field of graph theory, the windmill graph Wd(k,n) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a shared universal vertex. That is, it is a 1-clique-sum of these complete graphs.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph family made by joining complete graphs at a universal node
original url:
https://en.wikipedia.org/wiki/Windmill_graph
date created:
date modified:
2023-08-03T19:15:01Z
main entity:
{"identifier":"Q8024306","url":"https://www.wikidata.org/entity/Q8024306"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d2/Windmill_graph_Wd%285%2C4%29.svg","width":270,"height":265}
fields total:
13
integrity:
15