Live briefing
Everything about Windmill graph
Graph family made by joining complete graphs at a universal node
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Windmill graphA 5-minute orientation
- Skim a recent paper: Embedding Augmented Cube into Certain Trees and Windmill GraphsInfluential work since 2022
- Pick up a classic book: Sidereal WindmillThe most-reprinted book on the subject
- Read the landmark paper: Distance and eccentricity based invariants of windmill graphCited 10 times
- Go sideways: Friendship graphA closely related topic
- Go sideways: Anton KotzigA closely related topic
đź“– Definitions
Noun The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a shared universal vertex.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Distance and eccentricity based invariants of windmill graph
Computation of Topological Indices of Dutch Windmill Graph
Windmill Graph based Feature Descriptors for Facial Expression Recognition
Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph
About b-Coloring of Windmill Graph
On the strong metric dimension of sun graph, windmill graph, and möbius ladder graph
SOME ADRIATIC INDICES OF DUTCH WINDMILL GRAPH USING GRAPH OPERATOR
The rainbow connection of windmill and corona graph
🆕 Influential since 2022
đź“š Books worth reading
- 📕Sidereal WindmillSherri Harmon · 2019
- 📕Notebook : WindmillBlake Dv · 2017
- 📕Notebook : Journal Dot-Grid,Graph,Lined,Blank No Lined : Windmill with SunsetEthan Rhys · 2017
Save the Earth science experimentsElizabeth Snoke Harris · 2008
Marine navigation and safety of sea transportationInternational Navigational Symposium on Marine Navigation and Safety of Sea Transportation (8th 2009 Gdynia, Poland) · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Friendship graph In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices…
- Anton Kotzig Anton Kotzig (22 October 1919 – 20 April 1991) was a Slovak–Canadian mathematician, expert in statistics, combinatorics and graph theory. A number of his…
- Induced matching In graph theory, an induced matching or strong matching is a subset of the edges of an undirected graph that do not share any vertices (it is a matching)…
- Uniquely colorable graph In graph theory, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors. Equivalently…
- Equitable coloring In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that No…
- Graceful labeling Unsolved problem in mathematics Do all trees admit a graceful labeling? More unsolved problems in mathematics In graph theory, a graceful labeling of a…
- Line graph of a hypergraph In graph theory, particularly in the theory of hypergraphs, the line graph of a hypergraph H, denoted L(H), is the graph whose vertex set is the set of…
- Chi-bounded In graph theory, a χ-bounded (using the Greek letter chi) family ℱ of graphs is one for which there is some function f such that, for every integer t the…