- In mathematics, a queen's
graph is an
undirected graph that
represents all
legal moves of the queen—a
chess piece—on a chessboard. In the graph, each vertex...
- Burger, A. P.; ****ayne, E. J.; Mynhardt, C. M. (1997), "Domination and
irredundance in the queens' graph",
Discrete Mathematics, 163 (1–3): 47–66, doi:10...
- Hedetniemi, S.M.; Hedetniemi,
Stephen (2004-01-01). "Domination and
irredundance in tournaments". The
Australasian Journal of
Combinatorics [electronic...
- irrédondance et
autres paramètres de
graphes [Independence, domination,
irredundance, and
other parameters of graphs], was
supervised by Jean-Claude Bermond...
- = Q 1 ∩ ⋯ ∩ Q n {\displaystyle I=Q_{1}\cap \cdots \cap Q_{n}\ } .
Irredundancy means:
Removing any of the Q i {\displaystyle Q_{i}}
changes the intersection...
