About: Queen's graph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

In mathematics, a queen's graph is a graph that represents all legal moves of the queen—a chess piece—on a chessboard. In the graph, each vertex represents a square on a chessboard, and each edge is a legal move the queen can make, that is, a horizontal, vertical or diagonal move by any number of squares. If the chessboard has dimensions , then the induced graph is called the queen's graph.

Property Value
dbo:abstract
  • In mathematics, a queen's graph is a graph that represents all legal moves of the queen—a chess piece—on a chessboard. In the graph, each vertex represents a square on a chessboard, and each edge is a legal move the queen can make, that is, a horizontal, vertical or diagonal move by any number of squares. If the chessboard has dimensions , then the induced graph is called the queen's graph. Independent sets of the graphs correspond to placements of multiple queens where no two queens are attacking each other. They are studied in the eight queens puzzle, where eight non-attacking queens are placed on a standard chessboard. Dominating sets represent arrangements of queens where every square is attacked or occupied by a queen; five queens, but no fewer, can dominate the chessboard. Colourings of the graphs represent ways to colour each square so that a queen cannot move between any two squares of the same colour; at least n colours are needed for an chessboard, but 9 colours are needed for the board. (en)
dbo:thumbnail
dbo:wikiPageID
  • 70073990 (xsd:integer)
dbo:wikiPageLength
  • 12069 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1120458664 (xsd:integer)
dbo:wikiPageWikiLink
dbp:chromaticNumber
  • n if (en)
dbp:imageCaption
  • In an queen's graph, each square of the chessboard above is a vertex. There is an edge between any two vertices that a queen could move between; as an example, the vertices adjacent to d4 are marked with a white dot . (en)
dbp:name
  • Queen's graph (en)
dbp:properties
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, a queen's graph is a graph that represents all legal moves of the queen—a chess piece—on a chessboard. In the graph, each vertex represents a square on a chessboard, and each edge is a legal move the queen can make, that is, a horizontal, vertical or diagonal move by any number of squares. If the chessboard has dimensions , then the induced graph is called the queen's graph. (en)
rdfs:label
  • Queen's graph (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License