The graph Cartesian product 
of a complete graph 
and a path
graph 
has been termed a "KP graph" by Knuth (2024, pp. 20-21), who restricts
their parameters to 
and 
. The KP graphs have vertex
count, edge count, and (except for 
and 
)
graph automorphism count
 |  |  |
(1)
|
 |  |  |
(2)
|
 |  |  |
(3)
|
Special cases are summarized in the table below.
| graph | special case |
 | rook graph  |
 | path
graph  |
 | ladder grah  |
 | stacked
prism graph  |
 | complete graph  |
(i.e., the 
rook graphs) is ungraceful
for all 
(Knuth 2024, p. 22).
