Triangular Honeycomb Queen Graph

The -triangular honeycomb queen graph (DeMaio and Tran 2013) is a graph consisting of vertices on a triangular honeycomb board with vertices along each side, where vertices are connected by an edge if they lie along a horizontal, , or line of the chessboard. Note that the -triangular honeycomb queen graph was termed a hex rook by Gliński (1973) and Wagon (2014) and denoted by Wagon (2014). The graphs for and 4 are illustrated above.

Special cases are summarized in the following table.

	isomorphic graph
1	singleton graph
2	triangle graph
3	octahedral graph

Triangular honeycomb queen graphs are bridgeless, connected, Eulerian, Hamilton-connected, Hamiltonian, H-star connected, integral, LCF, regular, rigid, and traceable.

Triangular honeycomb queen graphs are implemented in the Wolfram Language as GraphData["TriangularHoneycombQueen", n].

Explore with Wolfram|Alpha

More things to try:

References

DeMaio, H. and Tran, L. "Domination and Independence on a Triangular Honeycomb Chessboard." College Math. J. 44, 307-314, 2013.Gliński, W. Rules of Hexagonal Chess With Examples of First Openings. London: Hexagonal Chess Publications, 1973.Wagon, S. "Graph Theory Problems from Hexagonal and Traditional Chess." College Math. J. 45, 278-287, 2014.

Cite this as:

Weisstein, Eric W. "Triangular Honeycomb Queen Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/TriangularHoneycombQueenGraph.html

Subject classifications

pFad - Phonifier reborn

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Triangular Honeycomb Queen Graph

See also

Explore with Wolfram|Alpha

References

Cite this as:

Subject classifications

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.