Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Windmill_graph> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Windmill_graph abstract "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 vertex. That is, it is a 1-clique-sum of these complete graphs.".
- Windmill_graph thumbnail Windmill_graph_Wd(5,4).svg?width=300.
- Windmill_graph wikiPageID "24373456".
- Windmill_graph wikiPageRevisionID "547947517".
- Windmill_graph chromaticIndex "n".
- Windmill_graph chromaticNumber "k".
- Windmill_graph diameter "2".
- Windmill_graph edges "nk/2".
- Windmill_graph girth "3".
- Windmill_graph hasPhotoCollection Windmill_graph.
- Windmill_graph imageCaption "The Windmill graph Wd.".
- Windmill_graph name "Windmill graph".
- Windmill_graph notation "Wd".
- Windmill_graph radius "1".
- Windmill_graph vertices "n+1".
- Windmill_graph subject Category:Parametric_families_of_graphs.
- Windmill_graph subject Category:Perfect_graphs.
- Windmill_graph type Abstraction100002137.
- Windmill_graph type Communication100033020.
- Windmill_graph type Graph107000195.
- Windmill_graph type VisualCommunication106873252.
- Windmill_graph comment "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 vertex. That is, it is a 1-clique-sum of these complete graphs.".
- Windmill_graph label "Windmill graph".
- Windmill_graph sameAs m.07s4nq1.
- Windmill_graph sameAs Q8024306.
- Windmill_graph sameAs Q8024306.
- Windmill_graph sameAs Windmill_graph.
- Windmill_graph wasDerivedFrom Windmill_graph?oldid=547947517.
- Windmill_graph depiction Windmill_graph_Wd(5,4).svg.
- Windmill_graph isPrimaryTopicOf Windmill_graph.