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)
|
KP graphs are regular only for 
(corresponding to complete graphs) and 
(corresponding to 
rook graphs).
特殊情况总结在下表中。
(即，
车图) 对于所有 
都是不优美的 (Knuth 2024, p. 22)。
