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

Ficheros
Estadísticas
Métricas y Citas
 
Compartir
Exportar a
EndNoteBibTexRIS
Metadatos
Mostrar el registro completo del ítem
Autor/es
Dokyeesun, Pakanun; Klavžar, Sandi; Kuziak, DorotaAutoridad UCA; Tian, Jing
Fecha
2026-12
Departamento/s
Estadística e Investigación Operativa
Fuente
Computational and Applied Mathematics - 2026, Vol. 45 n. 3, Article number 97
Resumen
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.
Materias
Outer general position; Dual general position; Total general position; Strong product; Lexicographic product
Colecciones
Atribución 4.0 Internacional
Esta obra está bajo una Licencia Creative Commons Atribución 4.0 Internacional