20.500.12556/DiRROS-24709 General position problems in strong and lexicographic products of graphs 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. outer general position dual general position total general position strong product lexicographic product zunanja splošna lega dualna splošna lega celotna splošna lega krepki produkt grafov leksikografski produkt grafov true false true Angleški jezik Slovenski jezik Neznano 2025-12-15 11:13:20 2025-12-15 11:13:21 2025-12-16 03:44:28 0000-00-00 00:00:00 2026 0 0 13 str. iss. 3, article no. 97 Vol. 45 Apr. 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2026-04-01 519.17 2238-3603 10.1007/s40314-025-03547-7 261377795 s40314-025-03547-7.pdf s40314-025-03547-7.pdf 1 D01DF2D9877917EFA8B28F81C90B8AAF 7f6662011c1c0a2dcf57f6527b1961f750bac55d6b4f9f4d875720c86648f4ed e3512869-d9a1-11f0-94a7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=36909 https://link.springer.com/article/10.1007/s40314-025-03547-7 1 b7289f0c-d99e-11f0-94a7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=36902 Inštitut za matematiko, fiziko in mehaniko 0 0 0