The -triangular honeycomb obtuse knight graph, called a hex knight
graph and denoted by Wagon (2014), thus conflicting with the same notation
used for the triangular honeycomb
acute knight graph by 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 are reachable by two steps in the same direction and one in a direction that
is "farther" from the initial vertex, thus
making an obtuse angle when the knight turns. The
graphs for and 5 are illustrated above.
Special cases are summarized in the following table.
DeMaio, J. and Tran, H. L. "Domination and Independence on a Triangular Honeycomb Chessboard." College Math. J.44, 307-314,
2013. https://doi.org/10.4169/college.math.j.44.4.307.Harborth,
H. and Stark, P. "Independent Knights on Triangular Honeycombs." Congr.
Numer.126, 157-161, 1997.House of Graphs. Triangular Honeycomb
Obtuse Knight Graphs. Empty graph
on 3 vertices., 6K1, and Singleton Graph.Wagon,
S. "Graph Theory Problems from Hexagonal and Traditional Chess." College
Math. J.45, 278-287, 2014. https://doi.org/10.4169/college.math.j.45.4.278.Watkins,
J. J. "Knight's Tours on Triangular Honeycombs." Congr. Numer.124,
81-87, 1997.
-triangular honeycomb obtuse knight graph, called a hex knight
graph and denoted 
by Wagon (2014), thus conflicting with the same notation
used for the triangular honeycomb
acute knight graph by 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 are reachable by two steps in the same direction and one in a direction that
is "farther" from the initial vertex, thus
making an obtuse angle when the knight turns. The
graphs for 
and 5 are illustrated above.
"TriangularHoneycombObtuseKnight",
n
].
