The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position number is additive on the Cartesian product of two trees.

中文翻译：

---

两棵树的笛卡尔积的总位置数

连通图的一般位置数是最大顶点集合的基数，使得集合中没有三个成对不同的顶点位于公共最短路径上。本文证明了一般位置数在两棵树的笛卡尔积上是可加的。