RT journal article
T1 On General Position Sets in Cartesian Products
A1 Klavžar, Sandi
A1 Patkós, Balázs
A1 Rus, Gregor
A1 González Yero, Ismael
A2 Matemáticas
K1 General position problem
K1 Cartesian product of graphs
K1 paths and cycles
K1 probabilistic constructions
K1 exact enumeration
AB The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets are refereed to as gpsets of G. The general position number of cylinders Pr square Cs is deduced. It is proved that gp(Cr square C-s). {6, 7} whenever r >= s = 3, s >=not equal 4, and r >= 6. 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 Pr square Ps, where r, s >= 2, is also determined.
PB SPRINGER BASEL AG
SN 1422-6383
YR 2021
FD 2021-08
LK http://hdl.handle.net/10498/26516
UL http://hdl.handle.net/10498/26516
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 13-nov-2026