RT journal article
T1 General position problems in strong and lexicographic products of graphs
A1 Dokyeesun, Pakanun
A1 Klavžar, Sandi
A1 Kuziak, Dorota
A1 Tian, Jing
A2 Estadística e Investigación Operativa
K1 Outer general position
K1 Dual general position
K1 Total general position
K1 Strong product
K1 Lexicographic product
AB Outer, dual, and total general position sets are studied on strong and lexicographic products ofgraphs. Sharp lower and upper bounds are proved for the outer and the dual general positionnumber of strong products and several exact values are obtained. For the lexicographicproduct, the outer general position number is determined in all the cases, and the dual generalposition number is established in many cases. The total general position number is determinedfor both products. Along the way some results on outer general position sets are also derived.
PB Springer Nature
SN 1807-0302
YR 2026
FD 2026-12
LK http://hdl.handle.net/10498/39258
UL http://hdl.handle.net/10498/39258
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 05-nov-2026