General position problems in strong and lexicographic products of graphs

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/39258

DOI: 10.1007/S40314-025-03547-7

ISSN: 1807-0302

ISSN: 2238-3603

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Dokyeesun, Pakanun; Klavžar, Sandi; Kuziak, DorotaAuthority UCA; Tian, Jing
Date
2026-12
Department
Estadística e Investigación Operativa
Source
Computational and Applied Mathematics - 2026, Vol. 45 n. 3, Article number 97
Abstract
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general position number of strong products and several exact values are obtained. For the lexicographic product, the outer general position number is determined in all the cases, and the dual general position number is established in many cases. The total general position number is determined for both products. Along the way some results on outer general position sets are also derived.
Subjects
Outer general position; Dual general position; Total general position; Strong product; Lexicographic product
Collections
Atribución 4.0 Internacional
This work is under a Creative Commons License Atribución 4.0 Internacional