加载中…
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three distinct vertices from lie on a common geodesic; such sets are refereed to as gp-sets of . The general position number of cylinders is deduced. It is proved that whenever , , and . A probabilistic lower bound on the general position number of Cartesian graph powers is achieved. Along the way a formula for the number of gp-sets in , where $r,s\ge 2$, is also determined.

生成讲解博客的中文版本

生成AI智能校验的中文版本