General position problems in strong and lexicographic products of graphs
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.
Authors
- Jing Tian (ORCID: https://orcid.org/0000-0002-4084-6911)
- Pakanun Dokyeesun
- Sandi Klavžar (ORCID: https://orcid.org/0000-0002-1556-4744)
- Dorota Kuziak (ORCID: https://orcid.org/0000-0001-9660-3284)
Institutions
- University of Ljubljana (SI)
- Zhejiang University of Science and Technology (CN)
- University of Maribor (SI)
- Universidad de Cádiz (ES)
- Institute of Mathematics, Physics, and Mechanics (SI)
Publication Details
- Journal
- Computational and Applied Mathematics
- Published
- 2025-12-15
- DOI
- https://doi.org/10.1007/s40314-025-03547-7
- Citations
- 1
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 1.50
Funders
- Ministerio de Educación, Cultura y Deporte
- Javna Agencija za Raziskovalno Dejavnost RS
- Ministerio de Ciencia e Innovación
- Univerza v Ljubljani